Sciweavers

439 search results - page 28 / 88
» Tabling for transaction logic
Sort
View
PVLDB
2011
14 years 6 months ago
Implementing Performance Competitive Logical Recovery
New hardware platforms, e.g. cloud, multi-core, etc., have led to a reconsideration of database system architecture. Our Deuteronomy project separates transactional functionality ...
David B. Lomet, Kostas Tzoumas, Michael J. Zwillin...
ICCAD
2008
IEEE
117views Hardware» more  ICCAD 2008»
15 years 8 months ago
On the numbers of variables to represent sparse logic functions
— In an incompletely specified function f, don’t care values can be chosen to minimize the number of variables to represent f. It is shown that, in incompletely specified fun...
Tsutomu Sasao
JMLR
2010
95views more  JMLR 2010»
14 years 6 months ago
Feature Extraction for Machine Learning: Logic-Probabilistic Approach
The paper analyzes peculiarities of preprocessing of learning data represented in object data bases constituted by multiple relational tables with ontology on top of it. Exactly s...
Vladimir Gorodetsky, Vladimir Samoilov
ICDE
2006
IEEE
120views Database» more  ICDE 2006»
16 years 1 months ago
Updates Through Views: A New Hope
Database views are extensively used to represent unmaterialized tables. Applications rarely distinguish between a materialized base table and a virtual view, thus, they may issue ...
Yannis Kotidis, Divesh Srivastava, Yannis Velegrak...
ICPR
2008
IEEE
15 years 6 months ago
A new method to obtain the shift-table in Boyer-Moore's string matching algorithm
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
Yang Wang