Sciweavers

277 search results - page 8 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
ICDE
1998
IEEE
119views Database» more  ICDE 1998»
14 years 10 months ago
Processing Incremental Multidimensional Range Queries in a Direct Manipulation Visual Query
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...
Stacie Hibino, Elke A. Rundensteiner
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 10 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
INFSOF
2007
98views more  INFSOF 2007»
13 years 8 months ago
Indexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
Hyung-Ju Cho, Chin-Wan Chung
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 9 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...