213 search results - page 36 / 43 » Querying Partially Sound and Complete Data Sources |
231
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
SIGMOD
1994
ACM
15 years 3 months ago
1994
ACM
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
SEMCO
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper describes work on Named Entity Recognition (NER), in preparation for Relation Extraction (RE), on data from a historical archive organisation. As is often the case in t...
119
click to vote
ICDT
2012
ACM
13 years 2 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
126
click to vote
DILS
2008
Springer
15 years 1 months ago
2008
Springer
It is not always clear how best to represent integrated data sets, and which application and database features allow a scientist to take best advantage of data coming from various ...