Sciweavers

ICDT
2009
ACM
148views Database» more  ICDT 2009»
15 years 1 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
85views Database» more  ICDT 2009»
15 years 1 months ago
Reconcilable differences
Todd J. Green, Zachary G. Ives, Val Tannen
ICDT
2009
ACM
119views Database» more  ICDT 2009»
15 years 1 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
129views Database» more  ICDT 2009»
15 years 1 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
166views Database» more  ICDT 2009»
15 years 1 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICDT
2009
ACM
128views Database» more  ICDT 2009»
15 years 1 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
ICDT
2009
ACM
119views Database» more  ICDT 2009»
15 years 1 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
143views Database» more  ICDT 2009»
15 years 1 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
ICDT
2009
ACM
198views Database» more  ICDT 2009»
15 years 1 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
ICDT
2009
ACM
108views Database» more  ICDT 2009»
15 years 1 months ago
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
Christoph Koch