Sciweavers

215 search results - page 12 / 43
» Tabling with Answer Subsumption: Implementation, Application...
Sort
View
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
13 years 2 months ago
Crescando
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data...
Georgios Giannikis, Philipp Unterbrunner, Jeremy M...
ANCS
2009
ACM
13 years 5 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
CHES
2007
Springer
327views Cryptology» more  CHES 2007»
14 years 2 months ago
On the Power of Bitslice Implementation on Intel Core2 Processor
Abstract. This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel’s new microprocessor Core2, particularly concentrating on “bitslice i...
Mitsuru Matsui, Junko Nakajima
ER
2001
Springer
136views Database» more  ER 2001»
14 years 13 days ago
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...
Dimitri Theodoratos, Theodore Dalamagas, Alkis Sim...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 9 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer