104 search results - page 4 / 21 » Range queries over skip tree graphs |
WEBDB
2004
Springer
14 years 23 days ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
ICWS
2009
IEEE
13 years 5 months ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
MDM
2007
Springer
14 years 1 months ago
2007
Springer
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of...