1429 search results - page 58 / 286 » Efficient processing of XPath queries using indexes |
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
DEBS
2010
ACM
13 years 3 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
We present the design of Scoop, a system for indexing and querying stored data in sensor networks. Scoop works by collecting statistics about the rate of queries and distribution ...
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...