Sciweavers

186 search results - page 6 / 38
» A Practical Approach to Hypothetical Database Queries
Sort
View
177
Voted
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 18 days ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
TC
1997
15 years 1 months ago
An Extensible Framework for Repairing Constraint Violations
In this paper we describe a new approach to repairing violations of integrity constraints in databases with null values. By adopting basic concepts from model-based diagnosis, we ...
Michael Gertz, Udo W. Lipeck
ICDT
1999
ACM
133views Database» more  ICDT 1999»
15 years 4 months ago
A Framework for the Investigation of Aggregate Functions in Database Queries
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
Luca Cabibbo, Riccardo Torlone
NDSS
2009
IEEE
15 years 7 months ago
Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan ...
126
Voted
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 7 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar