Sciweavers

2608 search results - page 260 / 522
» Inferring Answers to Queries
Sort
View
CADE
2001
Springer
16 years 7 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider
ERSHOV
2006
Springer
15 years 10 months ago
A Formal Model of Data Privacy
Information systems support data privacy by constraining user's access to public views and thereby hiding the non-public underlying data. The privacy problem is to prove that ...
Phiniki Stouppa, Thomas Studer
PODS
2003
ACM
118views Database» more  PODS 2003»
16 years 6 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
EDBT
2006
ACM
120views Database» more  EDBT 2006»
16 years 6 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
16 years 6 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...