Sciweavers

1542 search results - page 136 / 309
» Using Queries to Improve Database Reverse Engineering
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 29 days ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 5 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
128
Voted
SIGIR
2004
ACM
15 years 6 months ago
Multiple sources of evidence for XML retrieval
Document-centric XML collections contain text-rich documents, marked up with XML tags. The tags add lightweight semantics to the text. Querying such collections calls for a hybrid...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
161
Voted
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 4 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 29 days ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li