21 search results - page 2 / 5 » Dynamic Magic Sets for Disjunctive Datalog Programs |
109
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
113
Voted
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
117
Voted
SCCC
2005
IEEE
15 years 5 months ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
93
Voted
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Nowadays enterprises request information technologies that leverage structured and unstructured information for providing a single integrated view of business problems in...