2675 search results - page 464 / 535 » From Ontology to Relational Databases |
184
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
190
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
153
click to vote
ICDT
1999
ACM
15 years 10 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
154
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
182
click to vote
CIKM
1993
Springer
15 years 10 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...