Sciweavers

66 search results - page 2 / 14
» Dynamic indexability and lower bounds for dynamic one-dimens...
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 7 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 6 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
DEXA
2009
Springer
222views Database» more  DEXA 2009»
13 years 12 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
DEXA
2006
Springer
113views Database» more  DEXA 2006»
13 years 9 months ago
Dynamic Range Query in Spatial Network Environments
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
Fuyu Liu, Tai T. Do, Kien A. Hua
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