123 search results - page 3 / 25 » Efficient B-tree Based Indexing for Cloud Data Processing |
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
CIKM
2009
Springer
14 years 4 days ago
2009
Springer
With the development of positioning technologies and the boosting deployment of inexpensive location-aware sensors, large volumes of trajectory data have emerged. However, efficie...