Sciweavers

1059 search results - page 39 / 212
» Improving Semantic Query Answering
Sort
View
CIKM
2010
Springer
13 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
ICTAI
2009
IEEE
14 years 4 months ago
Design and Implementation of a Query Planner for Data Integration
1 Many applications require integrated access to multiple distributed, autonomous, and often semantically disparate data. Hence there is a need for bridging the semantic gap betwe...
Neeraj Koul, Vasant Honavar
WWW
2007
ACM
14 years 10 months ago
Answering bounded continuous search queries in the world wide web
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
Dirk Kukulenz, Alexandros Ntoulas
AGP
2003
IEEE
14 years 3 months ago
Reasoning about the Semantic Web using Answer Set Programming
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
Giovambattista Ianni, Francesco Calimeri, Vincenzi...
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 4 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier