An Extension of Counting Method for Efficient Processing of the Cyclic Data.
Jai Hyoung Rhee, Seog Park:
An Extension of Counting Method for Efficient Processing of the Cyclic Data.
DASFAA 1989: 320-326@inproceedings{DBLP:conf/dasfaa/RheeP89,
author = {Jai Hyoung Rhee and
Seog Park},
editor = {Sukho Lee and
Hideko S. Kunii and
Won Kim and
In Sup Paik and
Yahiko Kambayashi},
title = {An Extension of Counting Method for Efficient Processing of the
Cyclic Data},
booktitle = {International Symposium on Database Systems for Advanced Applications,
Seoul, Korea, April 10-12, 1989},
publisher = {Dept. of Computer Science, KAIST, P.O. Box 150, ChongRyang, Seoul,
131-650, Korea},
year = {1989},
pages = {320-326},
ee = {db/conf/dasfaa/RheeP89.html},
crossref = {DBLP:conf/dasfaa/89},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
In this paper, we consider a recursive query processing
in deductive database system which contains cyclic data.
Cyclic data is a data which forms a cycle produced by
recursive rule. The presence of cyclic data causes not only
redundant works but also termination problem. In general,
counting method performs well on non-cyclic data. However,
counting method fails in the presence of cyclic data in
deductive database. Tberefore, we extend the counting
method to deal with cyclic data.
Copyright © 1989 by The Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. Permission to copy without all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the DASFAA copyright notice and the
title of the publication and its date appear, and notice is given that copying is by permission of the Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. To copy otherwise, or to republish, requires a fee and/or special permission from the Organizing Commitee.
CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
References
- [1]
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Data Structures and Algorithms.
Addison-Wesley 1983, ISBN 0-201-00023-7
BibTeX
- [2]
- François Bancilhon, Raghu Ramakrishnan:
Performance Evaluation of Data Intensive Logic Programs.
Foundations of Deductive Databases and Logic Programming. 1988: 439-517 BibTeX
- [3]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52 BibTeX
- [4]
- Catriel Beeri, Raghu Ramakrishnan:
On the Power of Magic.
PODS 1987: 269-284 BibTeX
- [5]
- François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs.
PODS 1986: 1-15 BibTeX
- [6]
- Upen S. Chakravarthy, John Grant, Jack Minker:
Foundations of Semantic Query Optimization for Deductive Databases.
Foundations of Deductive Databases and Logic Programming. 1988: 243-273 BibTeX
- [7]
- ...
- [8]
- Jiawei Han, Lawrence J. Henschen:
Handling Redundancy in the Processing of Recursive Database Queries.
SIGMOD Conference 1987: 73-81 BibTeX
- [9]
- Jiawei Han, Hongjun Lu:
Some Performance Results on Recursive Query Processing in Relational Database Systems.
ICDE 1986: 533-541 BibTeX
- [10]
- Ramsey W. Haddad, Jeffrey F. Naughton:
Counting Methods for Cyclic Relations.
PODS 1988: 333-340 BibTeX
- [11]
- Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà:
Worst-case Complexity Analysis of Methods for Logic Query Implementation.
PODS 1987: 294-301 BibTeX
- [12]
- Domenico Saccà, Carlo Zaniolo:
Magic Counting Methods.
SIGMOD Conference 1987: 49-59 BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:05:14 2009