Sciweavers

183 search results - page 3 / 37
» An Abstract Framework for Generating Maximal Answers to Quer...
Sort
View
FOIKS
2004
Springer
14 years 23 days ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
ICTAI
2008
IEEE
14 years 1 months ago
Answering Complex Questions Using Query-Focused Summarization Technique
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
Yllias Chali, Shafiq R. Joty
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 6 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
SUM
2010
Springer
13 years 5 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
JLP
2000
102views more  JLP 2000»
13 years 7 months ago
Recursive Query Plans for Data Integration
Generating query-answering plans for data integration systems requires to translate a user query, formulated in terms of a mediated schema, to a query that uses relations that are...
Oliver M. Duschka, Michael R. Genesereth, Alon Y. ...