277 search results - page 37 / 56 » Opportunistic Data Structures for Range Queries |
GIS
2005
ACM
14 years 9 months ago
2005
ACM
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
XIMEP
2005
ACM
14 years 2 months ago
2005
ACM
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
ESA
2000
Springer
14 years 13 days ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
JCST
2010
13 years 3 months ago
2010
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...