62 search results - page 6 / 13 » A Family of Incomplete Relational Database Models |
SDB
1995
13 years 11 months ago
1995
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...
VLDB
1998
ACM
14 years 1 days ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
IJCAI
2001
13 years 9 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
KDD
1997
ACM
14 years 4 hour ago
1997
ACM
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...