Sciweavers

104 search results - page 5 / 21
» Range queries over skip tree graphs
Sort
View
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
14 years 8 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
13 years 11 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 8 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
PODC
2004
ACM
14 years 26 days ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
ISPDC
2006
IEEE
14 years 1 months ago
DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems
Supporting range query over Peer-to-Peer systems has attracted many research efforts in recent years. In this paper, we propose a new multidimentional indexing structure for P2P s...
Xinfa Wei, Kaoru Sezaki