24 search results - page 1 / 5 » Datalog Programs over Infinite Databases, Revisited |
DBPL
2007
Springer
13 years 9 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...
SEBD
2001
13 years 6 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...