439 search results - page 42 / 88 » Tabling for transaction logic |
103
click to vote
CINQ
2004
Springer
15 years 5 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
PVLDB
2010
14 years 10 months ago
2010
In this paper, we describe a main memory hybrid database system called HYRISE, which automatically partitions tables into vertical partitions of varying widths depending on how th...
AI
2001
Springer
15 years 4 months ago
2001
Springer
As new transactions update data sources and subsequently the data warehouse, the previously discovered association rules in the old database may no longer be interesting rules in ...
FASE
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
110
click to vote
FMCO
2007
Springer
15 years 6 months ago
2007
Springer
This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the seman...