Sciweavers

500 search results - page 78 / 100
» Asynchronous Search with Aggregations
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 8 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
SIGMOD
2008
ACM
189views Database» more  SIGMOD 2008»
14 years 8 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
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
14 years 8 months ago
M-invariance: towards privacy preserving re-publication of dynamic datasets
The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-pu...
Xiaokui Xiao, Yufei Tao
SIGMOD
2005
ACM
360views Database» more  SIGMOD 2005»
14 years 8 months ago
NaLIX: an interactive natural language interface for querying XML
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy ...
Yunyao Li, Huahai Yang, H. V. Jagadish
SIGMOD
2004
ACM
95views Database» more  SIGMOD 2004»
14 years 8 months ago
Querying at Internet-Scale
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its comm...
Brent N. Chun, Joseph M. Hellerstein, Ryan Huebsch...