• Publications
  • Influence
The well-founded semantics for general logic programs
TLDR
A general logic program (abbreviated to "program" hereafter) is a set of roles that have both positive and negative subgoals. Expand
  • 1,856
  • 158
  • PDF
Abstract Harmonic Analysis
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria.Expand
  • 3,625
  • 125
Filtering algorithms and implementation for very fast publish/subscribe systems
TLDR
Publish/subscribe is the paradigm in which users express long-term interests (“subscriptions”) and some agent “publishes” events (e.g., offers). Expand
  • 610
  • 43
  • PDF
Making B+- trees cache conscious in main memory
TLDR
We propose a new indexing technique called Cache Sensitive B+-Trees that stores all the child nodes of any given node contiguously, and keeps only the address of the first child in each node. Expand
  • 364
  • 38
  • PDF
Cache Conscious Indexing for Decision-Support in Main Memory
TLDR
We study indexing techniques for main memory, including hash indexes, binary search trees, T-Trees, B+-trees, interpolation search, and binary search on arrays. Expand
  • 302
  • 28
  • PDF
Unfounded sets and well-founded semantics for general logic programs
TLDR
A general logic program (abbreviated to “program” hereafter) is a set of rules that have both positive and negative subgoals. Expand
  • 475
  • 26
Fast Computation of Sparse Datacubes
TLDR
We propose a novel algorithm for the fast computation of datacubes over sparse relations, and demonstrate the efficiency of our algorithm using synthetic, benchmark and real-world data sets. Expand
  • 250
  • 21
Rethinking SIMD Vectorization for In-Memory Databases
TLDR
We present novel vectorized designs and implementations of database operators, based on advanced SIMD operations, such as gathers and scatters, and combine them to build sorting and joins. Expand
  • 151
  • 20
  • PDF