Sciweavers

373 search results - page 16 / 75
» Querying Priced Information in Databases: The Conjunctive Ca...
Sort
View
SDB
1995
178views Database» more  SDB 1995»
15 years 1 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
PODS
2004
ACM
98views Database» more  PODS 2004»
15 years 9 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
72
Voted
ICDT
1995
ACM
101views Database» more  ICDT 1995»
15 years 1 months ago
Approximation in Databases
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
Leonid Libkin
CIKM
2001
Springer
15 years 2 months ago
The Effectiveness of Query Expansion for Distributed Information Retrieval
Query expansion has been shown effective for both single database retrieval and for distributed information retrieval where complete collection information is available. One might...
Paul Ogilvie, James P. Callan
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 9 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki