6004 search results - page 390 / 1201 » Parallelizing query optimization |
155
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
197
click to vote
SIGMOD
2006
ACM
16 years 24 days ago
2006
ACM
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
158
click to vote
WAIM
2005
Springer
16 years 9 days ago
2005
Springer
In order to lay a solid foundation for the emerging semantic web, effective and efficient management of large RDF(S) data is in high demand. In this paper we propose an approach t...
190
click to vote
SEMWEB
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
176
click to vote
ISMIS
1999
Springer
15 years 11 months ago
1999
Springer
Semantic Query Optimisation makes use of the semantic knowledge of a database (rules) to perform query transformation. Rules are normally learned from former queries fired by the u...