123 search results - page 7 / 25 » Efficient B-tree Based Indexing for Cloud Data Processing |
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
DEXA
2004
Springer
14 years 26 days ago
2004
Springer
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
CIKM
2004
Springer
14 years 27 days ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...