Sciweavers

505 search results - page 15 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
INEX
2004
Springer
15 years 3 months ago
If INEX Is the Answer, What Is the Question?
The INEX query languages allow the extraction of fragments from selected documents. This power is not much used in INEX queries. The paper suggests reasons why, and considers which...
Richard A. O'Keefe
ICDE
2006
IEEE
141views Database» more  ICDE 2006»
15 years 11 months ago
Clean Answers over Dirty Databases: A Probabilistic Approach
The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such...
Ariel Fuxman, Periklis Andritsos, Renée J. ...
DLOG
2011
14 years 1 months ago
Repairing Incomplete Reasoners
Abstract. The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems witho...
Giorgos Stoilos, Bernardo Cuenca Grau
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
16 years 9 months ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...
ISEMANTICS
2010
14 years 8 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...