277 search results - page 45 / 56 » Opportunistic Data Structures for Range Queries |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
SSD
2009
Springer
14 years 2 months ago
2009
Springer
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
APWEB
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...