Sciweavers

9 search results - page 2 / 2
» SEPIA: estimating selectivities of approximate string predic...
Sort
View
EDBT
2009
ACM
127views Database» more  EDBT 2009»
14 years 1 days ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 6 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
13 years 11 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
VLDB
2001
ACM
114views Database» more  VLDB 2001»
13 years 9 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons