1429 search results - page 112 / 286 » Efficient processing of XPath queries using indexes |
VLDB
2012
ACM
12 years 4 months ago
2012
ACM
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Large-scale web and text retrieval systems deal with amounts of data that greatly exceed the capacity of any single machine. To handle the necessary data volumes and query through...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...