Sciweavers

30 search results - page 3 / 6
» The 1-Versus-2 Queries Problem Revisited
Sort
View
AMW
2010
13 years 7 months ago
On the Decidability of Consistent Query Answering
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
Marcelo Arenas, Leopoldo E. Bertossi
ICDE
2012
IEEE
196views Database» more  ICDE 2012»
11 years 8 months ago
Scalable Multi-query Optimization for SPARQL
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
Wangchao Le, Anastasios Kementsietsidis, Songyun D...
COMPGEOM
1997
ACM
13 years 10 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
DASFAA
2009
IEEE
96views Database» more  DASFAA 2009»
13 years 9 months ago
A Revisit of Query Expansion with Different Semantic Levels
Abstract. Query expansion has received extensive attention in information retrieval community. Although semantic based query expansion appears to be promising in improving retrieva...
Ce Zhang, Bin Cui, Gao Cong, Yu-Jing Wang
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 1 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman