Sciweavers

4095 search results - page 596 / 819
» How to test a tree
Sort
View
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 8 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 8 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
SIGMOD
2005
ACM
127views Database» more  SIGMOD 2005»
14 years 8 months ago
Fossilized Index: The Linchpin of Trustworthy Non-Alterable Electronic Records
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
Qingbo Zhu, Windsor W. Hsu
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 8 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 8 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han