2859 search results - page 134 / 572 » Querying Complex Structured Databases |
WEBDB
2004
Springer
14 years 1 months ago
2004
Springer
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
GIS
1995
ACM
13 years 11 months ago
1995
ACM
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
DASFAA
2008
IEEE
14 years 2 months ago
2008
IEEE
Twig pattern matching (TPM) is the core operation of XML query processing. Existing approaches rely on either efficient data structures or novel labeling/indexing schemes to reduce...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...