Sciweavers

24 search results - page 2 / 5
» Datalog Programs over Infinite Databases, Revisited
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
VLDB
2007
ACM
153views Database» more  VLDB 2007»
14 years 6 months ago
Declarative Information Extraction Using Datalog with Embedded Extraction Predicates
In this paper we argue that developing information extraction (IE) programs using Datalog with embedded procedural extraction predicates is a good way to proceed. First, compared ...
Warren Shen, AnHai Doan, Jeffrey F. Naughton, Ragh...
PODS
2005
ACM
136views Database» more  PODS 2005»
14 years 6 months ago
Context-sensitive program analysis as database queries
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
Monica S. Lam, John Whaley, V. Benjamin Livshits, ...
PPDP
2010
Springer
13 years 4 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
ER
2008
Springer
110views Database» more  ER 2008»
13 years 8 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi