Sciweavers

56 search results - page 8 / 12
» Dynamic Structures for Top- k Queries on Uncertain Data
Sort
View
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
15 years 10 months ago
SAO: A Stream Index for Answering Linear Optimization Queries
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
Gang Luo, Kun-Lung Wu, Philip S. Yu
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
15 years 3 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin
106
Voted
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
15 years 2 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu
112
Voted
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 1 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
COMPGEOM
2003
ACM
15 years 2 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...