Sciweavers

4438 search results - page 25 / 888
» Speculative Query Processing
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 7 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
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...
Alan Nash, Bertram Ludäscher
IJWIS
2008
110views more  IJWIS 2008»
13 years 7 months ago
Determined: a system with novel techniques for XML query optimization and evaluation
: Purpose -- Efficient processing of XML queries is critical for XML data management and related applications. Previously proposed techniques are unsatisfactory. This article prese...
Dunren Che, Wen-Chi Hou
EDBT
2002
ACM
139views Database» more  EDBT 2002»
14 years 7 months ago
Aggregate Processing of Planar Points
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
Yufei Tao, Dimitris Papadias, Jun Zhang
SIGMOD
2006
ACM
162views Database» more  SIGMOD 2006»
14 years 7 months ago
Adaptive query processing: why, how, when, what next
Adaptive query processing has been the subject of a great deal of recent work, particularly in emerging data management environments such as data integration and data streams. We ...
Amol Deshpande, Joseph M. Hellerstein, Vijayshanka...
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 7 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler