Sciweavers

26 search results - page 2 / 6
» icdt 2009
Sort
View
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 5 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 5 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 5 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 5 months ago
Incremental XPath evaluation
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...
Henrik Björklund, Marcel Marquardt, Wim Marte...
ICDT
2009
ACM
109views Database» more  ICDT 2009»
14 years 5 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo