Sciweavers

93 search results - page 15 / 19
» Efficient Table Anonymization for Aggregate Query Answering
Sort
View
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
15 years 11 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 1 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
VLDB
2007
ACM
118views Database» more  VLDB 2007»
15 years 12 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
16 years 1 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
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
15 years 11 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou