Sciweavers

93 search results - page 5 / 19
» Efficient Table Anonymization for Aggregate Query Answering
Sort
View
GIR
2006
ACM
15 years 5 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 29 days ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
SIGMOD
2008
ACM
189views Database» more  SIGMOD 2008»
15 years 11 months ago
Dynamic anonymization: accurate statistical analysis with privacy preservation
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
Xiaokui Xiao, Yufei Tao
AMW
2009
15 years 21 days ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
ESORICS
2009
Springer
16 years 6 days ago
Super-Efficient Aggregating History-Independent Persistent Authenticated Dictionaries
Authenticated dictionaries allow users to send lookup requests to an untrusted server and get authenticated answers. Persistent authenticated dictionaries (PADs) add queries agains...
Scott A. Crosby, Dan S. Wallach