219 search results - page 4 / 44 » Intensional Query Answering: An Application of Partial Evalu... |
PODS
1999
ACM
13 years 10 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
ICDE
2005
IEEE
14 years 7 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
ICDE
2007
IEEE
14 years 7 months ago
2007
IEEE
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
PVLDB
2010
13 years 4 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
ER
2004
Springer
13 years 10 months ago
2004
Springer
The semantic web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. Ontologies, a cornerstone of the semantic web,...