(Enter summary)
Abstract: We present an efficient evaluation technique for modularly stratified programs for which
the local strata level mappings are known at compile time. We present an important subclass
of these programs (called EMS-programs) in which one can easily express problems such as
shortest distance, company ownership, bill of materials, preferential vote counting, and matrix
diagonalization. Programs written in this style are easier to understand and can be efficiently
computed. Another virtue of these... (Update)
Context of citations to this paper: More
.... which attempts to unify active and deductive semantics based on an X Y stratification mechanism , similar to EMS stratification in Kemp [21]. We now consider the kind of semantics most appropriate for specifying each of these three entities. 3.1 Event Semantics In order to...
.... Specialization of the program with respect to the query can be achieved using a restricted form of the magic sets transformation (see [4] for details) We start with a simple, yet effective technique, and then show how, for a large number of cases, further improvements can be...
Cited by: More
A Deductive Database Solution to the Preferential Vote Counting .. - David Kemp
(Correct)
Issues in Active Databases - Bailey, Ramamohanarao (1995)
(Correct)
Active bibliography (related documents): More All
0.6: Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995)
(Correct)
0.6: Bottom-up Evaluation and Query Optimization of.. - Kemp, Srivastava, Stuckey (1995)
(Correct)
0.6: Foundations of Deductive Object-Oriented Database Systems - Dobbie (1996)
(Correct)
Similar documents based on text: More All
0.1: Constraint Stratification in Deductive Databases - Ross
(Correct)
0.1: A Syntactic Stratification Condition Using Constraints - Kenneth Ross (1994)
(Correct)
0.1: Reasoning with Modularly Pointwise Preferential Relations - Arieli
(Correct)
Related documents from co-citation: More All
4: Ullman J. D.: Principles of Database and Knowledge-Base Systems, Volumes 1 and 2. Computer Science Press, 1988. This article was processed using the L scaled 913a T E X macro package with LLNCS style
2: The Aditi Deductive Database System
- Vaghani, Ramamohanarao et al. - 1990
2: Why Not Negation By Fixpoint (context) - Kolaitis, Papadimitriou - 1991
BibTeX entry: (Update)
D. B. Kemp and K. Ramamohanarao. Syntactically recognizable modularly stratified programs. In Proceedings of the 5th Australasian Database Conference, January 1994 http://citeseer.ist.psu.edu/kemp94syntactically.html More
@inproceedings{ kemp94syntactically,
author = "David B. Kemp and Kotagiri Ramamohanarao",
title = "Syntactically Recognizable Modularly Stratified Programs",
booktitle = "Australasian Database Conference",
pages = "147-161",
year = "1994",
url = "citeseer.ist.psu.edu/kemp94syntactically.html" }
Citations (may not include all citations):
981
Principles of database and knowledge-base systems (context) - Ullman - 1988
981
Principles of database and knowledge-base systems (context) - Ullman - 1989
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988
310
A note on two problems in connection with graphs (context) - Dijkstra - 1959
204
Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
204
the declarative semantics of deductive databases and logic p.. (context) - Przymusinski - 1988
121
the power of magic
- Beeri, Ramakrishnan - 1987
105
Making prolog more expressive (context) - Lloyd, Topor - 1984
73
Modular stratification and magic sets for DATALOG programs w.. (context) - Ross - 1990
65
Why not negation by fixpoint (context) - Kolaitis, Papadimitriou - 1988
50
A generalization of the differential approach to recursive q.. (context) - Balbin, Ramamohanarao - 1987
41
Aggregation and relevance in deductive databases
- Sudarshan, Ramakrishnan - 1991
40
Semantics of logic programs with aggregates
- Kemp, Stuckey - 1991
33
Minimum and maximum predicates in logic programming
- Ganguly, Greco et al. - 1991
31
Magic sets and bottom-up evaluation of well-founded models
- Kemp, Stuckey et al. - 1991
28
Rule ordering in bottom-up fixpoint evaluation of logic prog..
- Ramakrishnan, Srivastava et al. - 1990
24
Surveys in Computer Science (context) - Ceri, Gottlob et al. - 1990
20
Efficient bottom-up computation of queries on stratified dat.. (context) - Balbin, Port et al. - 1991
18
Springer Series in Symbolic Computation (context) - Lloyd, logic - 1987
15
The magic of duplicates and aggregates (context) - Mumick, Pirahesh et al. - 1990
11
and Raghu Ramakrishnan (context) - Mumick, Finkelstein et al. - 1990
7
A query independent method for magic set computation on stra.. (context) - Balbin, Meenakshi et al. - 1988
6
Recursive aggregates in the EKS-V1 system (context) - Lefebvre - 1991
3
Query restricted bottom-up evaluation in normal form logic (context) - Kemp, Stuckey et al. - 1992
2
To appear in the New Generation of Computing Journal (context) - Lefebvre, efficient et al. - 1993
1
Efficient bottom-up computation on recursively defined deduc.. (context) - Balbin - 1989
Documents on the same site (http://munkora.cs.mu.oz.au/publications/tr_db/TR.html): More
Effective Clustering of Records for Fast Query Processing - Ramamohanarao, Harris (1996)
(Correct)
Optimal Clustering of Relations in a Database System - Harris, Ramamohanarao (1994)
(Correct)
Multiple Paths Join for Nested Relational Databases - Liu, Ramamohanarao (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC