1429 search results - page 108 / 286 » Efficient processing of XPath queries using indexes |
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
DAGSTUHL
2004
13 years 10 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...