Sciweavers

109 search results - page 20 / 22
» Evaluating top-k queries over incomplete data streams
Sort
View
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
15 years 11 months ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
PVLDB
2008
116views more  PVLDB 2008»
15 years 5 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
16 years 10 days ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
DEXA
2009
Springer
222views Database» more  DEXA 2009»
16 years 18 days ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
LPNMR
2005
Springer
15 years 11 months ago
Data Integration: a Challenging ASP Application
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
Nicola Leone, Thomas Eiter, Wolfgang Faber, Michae...