Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different f...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...