Sciweavers

627 search results - page 60 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
VLDB
2002
ACM
83views Database» more  VLDB 2002»
15 years 5 months ago
Searching on the Secondary Structure of Protein Sequences
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
Laurie Hammel, Jignesh M. Patel
WWW
2007
ACM
16 years 6 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 10 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 6 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
16 years 7 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...