The well-founded semantics for general logic programs
- A. V. Gelder, K. A. Ross, J. Schlipf
- Computer ScienceJACM
- 1 July 1991
It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.
Tabled Evaluation with Delaying for General Logic Programs
- K. A. Ross
- Computer Science
- 1996
The semantics of predicate logic as a programming language, Magic sets and bottom-up evaluation of well-founded models, and top-down query evaluation procedure for stratiied databases are reviewed.
Making B+- trees cache conscious in main memory
- J. Rao, K. A. Ross
- Computer ScienceACM SIGMOD Conference
- 2000
A new indexing technique called CSB+-Trees is proposed that stores all the child nodes of any given node contiguously, and keeps only the address of the first child in each node, and introduces two variants of CSB+, which can reduce the copying cost when there is a split and preallocate space for the full node group to reduce the split cost.
Filtering algorithms and implementation for very fast publish/subscribe systems
- Françoise Fabret, H. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, D. Shasha
- Computer ScienceACM SIGMOD Conference
- 1 May 2001
An attempt at the construction of novel data structures and implementations that enable the creation of more scalable, high performance publish/subscribe systems is described.
Cache Conscious Indexing for Decision-Support in Main Memory
- J. Rao, K. A. Ross
- Computer ScienceVery Large Data Bases Conference
- 7 September 1999
A new indexing technique called \Cache-Sensitive Search Trees" (CSS-trees) is proposed, to provide faster lookup times than binary search by paying attention to reference locality and cache behavior, without using substantial extra space.
Unfounded sets and well-founded semantics for general logic programs
- A. V. Gelder, K. A. Ross, J. Schlipf
- Computer ScienceACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 1 March 1988
It is shown that a program has a unique stable model if it has a well-founded model, in which case they are the same, and the converse is not true.
Fast Computation of Sparse Datacubes
- K. A. Ross, D. Srivastava
- Computer ScienceVery Large Data Bases Conference
- 25 August 1997
This work proposes a novel algorithm for the fast computation of datacubes over sparse relations, and demonstrates the efficiency of the algorithm using synthetic, benchmark and real-world data sets.
Rethinking SIMD Vectorization for In-Memory Databases
- Orestis Polychroniou, Arun Raghavan, K. A. Ross
- Computer ScienceSIGMOD Conference
- 27 May 2015
This paper presents novel vectorized designs and implementations of database operators, based on advanced SIMD operations, such as gathers and scatters, and highlights the impact of efficient vectorization on the algorithmic design of in-memorydatabase operators, as well as the architectural design and power efficiency of hardware.
Monotonic aggregation in deductive databases
- K. A. Ross, Y. Sagiv
- Computer Science, EconomicsACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 1 July 1992
This work forms a minimal model of a program component including aggregate operators, rather than insisting that the aggregate apply to atoms that have been fully determined, or that aggregate functions are rewritten in terms of negation.
Materialized view maintenance and integrity constraint checking: trading space for time
- K. A. Ross, D. Srivastava, S. Sudarshan
- Computer ScienceACM SIGMOD Conference
- 1 June 1996
It is shown that it is possible to reduce the total time cost of view maintenance by materializing (and maintaining) additional views, and it is demonstrated that global optimization cannot, in general, be achieved by locally optimizing each materialized subview.
...
...