Sciweavers

921 search results - page 16 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
166
Voted
WAIM
2009
Springer
15 years 10 months ago
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Li...
144
Voted
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
15 years 8 months ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
152
Voted
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
242
Voted
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 5 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...
125
Voted
WWW
2009
ACM
16 years 4 months ago
Exploiting web search engines to search structured databases
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
Arnd Christian König, Dong Xin, Kaushik Chakr...