348 search results - page 52 / 70 » An Efficient Index Lattice for XML Query Evaluation |
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
DEXA
2010
Springer
13 years 8 months ago
2010
Springer
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
SSD
2001
Springer
14 years 3 days ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...