1007 search results - page 35 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
122
click to vote
DEXA
2005
Springer
15 years 7 months ago
2005
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
118
Voted
PVLDB
2008
15 years 1 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
238
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization proces...
136
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
121
click to vote
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...