Sciweavers

157 search results - page 5 / 32
» Incremental Evaluation of Datalog Queries
Sort
View
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 8 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
ICLP
2007
Springer
14 years 2 months ago
Logic Programming Approach to Automata-Based Decision Procedures
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
Gulay Ünel, David Toman
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 9 months ago
Incremental XPath evaluation
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...
Henrik Björklund, Marcel Marquardt, Wim Marte...
JAPLL
2010
179views more  JAPLL 2010»
13 years 7 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
DBPL
1999
Springer
101views Database» more  DBPL 1999»
14 years 27 days ago
On the Power of Incremental Evaluation in SQL-Like Languages
We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) ...
Leonid Libkin, Limsoon Wong