d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications to a database view may not correspond uniquely to...
Aaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vau...
In order to protect individuals' privacy, the technique of kanonymization has been proposed to de-associate sensitive attributes from the corresponding identifiers. In this p...
In sensor networks, data acquisition frequently takes place at lowcapability devices. The acquired data is then transmitted through a hierarchy of nodes having progressively incre...
Utkarsh Srivastava, Kamesh Munagala, Jennifer Wido...
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Direct reductions of partial differential equations to systems of ordinary differential equations are in one-to-one correspondence with compatible differential constraints. The dif...