Sciweavers

277 search results - page 35 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
IMC
2005
ACM
14 years 2 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
PODS
1998
ACM
152views Database» more  PODS 1998»
14 years 1 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 10 months ago
Sketch-Based Summarization of Ordered XML Streams
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
Veronica Mayorga, Neoklis Polyzotis
VLDB
2007
ACM
122views Database» more  VLDB 2007»
14 years 9 months ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 9 months 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