Sciweavers

25 search results - page 2 / 5
» Data Structures for Range-Aggregate Extent Queries
Sort
View
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
PVLDB
2008
138views more  PVLDB 2008»
13 years 4 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
SSD
2005
Springer
185views Database» more  SSD 2005»
13 years 10 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
SIGMOD
2000
ACM
164views Database» more  SIGMOD 2000»
13 years 9 months ago
A Data Model and Data Structures for Moving Objects Databases
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...
Luca Forlizzi, Ralf Hartmut Güting, Enrico Na...
P2P
2006
IEEE
229views Communications» more  P2P 2006»
13 years 10 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...