Efficient evaluation of right-, Left-, and Multi-Linear Rules

J. F. Naughton; R. Ramakrishnan; Y. Sagiv; J. D. Ullman

doi:10.1145/67544.66948

Efficient evaluation of right-, Left-, and Multi-Linear Rules

J. F. Naughton, R. Ramakrishnan, Y. Sagiv, J. D. Ullman

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

We present an algorithm for the efficient evaluation of a useful subset of recursive queries. Like the magic sets tranformation, the algorithm consists of a rewriting phase followed by semi-naive bottom-up evaluation of the resulting rules. We prove that on a wide range of recursions, this algorithm achieves a factor of 0(n) speedup over magic sets. Intuitively, the transformations in this algorithm achieve their performance by reducing the arity of the recursive predicates in the transformed rules.

Original language	English
Title of host publication	Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989
Publisher	Association for Computing Machinery
Pages	235-242
Number of pages	8
ISBN (Electronic)	0897913175
DOIs	https://doi.org/10.1145/67544.66948
State	Published - 1 Jun 1989
Event	1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989 - Portland, United States Duration: 31 May 1989 → 2 Jun 1989

Publication series

Name	Proceedings of the ACM SIGMOD International Conference on Management of Data
Volume	Part F130127
ISSN (Print)	0730-8078

Conference

Conference	1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989
Country/Territory	United States
City	Portland
Period	31/05/89 → 2/06/89

Bibliographical note

Publisher Copyright:
© 1989 ACM.

Access to Document

10.1145/67544.66948

Cite this

Naughton, J. F., Ramakrishnan, R., Sagiv, Y., & Ullman, J. D. (1989). Efficient evaluation of right-, Left-, and Multi-Linear Rules. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989 (pp. 235-242). (Proceedings of the ACM SIGMOD International Conference on Management of Data; Vol. Part F130127). Association for Computing Machinery. https://doi.org/10.1145/67544.66948

@inproceedings{60a1f8c7019640cfa53c077a9a637132,

title = "Efficient evaluation of right-, Left-, and Multi-Linear Rules",

abstract = "We present an algorithm for the efficient evaluation of a useful subset of recursive queries. Like the magic sets tranformation, the algorithm consists of a rewriting phase followed by semi-naive bottom-up evaluation of the resulting rules. We prove that on a wide range of recursions, this algorithm achieves a factor of 0(n) speedup over magic sets. Intuitively, the transformations in this algorithm achieve their performance by reducing the arity of the recursive predicates in the transformed rules.",

author = "Naughton, \{J. F.\} and R. Ramakrishnan and Y. Sagiv and Ullman, \{J. D.\}",

note = "Publisher Copyright: {\textcopyright} 1989 ACM.; 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989 ; Conference date: 31-05-1989 Through 02-06-1989",

year = "1989",

month = jun,

day = "1",

doi = "10.1145/67544.66948",

language = "אנגלית",

series = "Proceedings of the ACM SIGMOD International Conference on Management of Data",

publisher = "Association for Computing Machinery",

pages = "235--242",

booktitle = "Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989",

}

Naughton, JF, Ramakrishnan, R, Sagiv, Y & Ullman, JD 1989, Efficient evaluation of right-, Left-, and Multi-Linear Rules. in Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989. Proceedings of the ACM SIGMOD International Conference on Management of Data, vol. Part F130127, Association for Computing Machinery, pp. 235-242, 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989, Portland, United States, 31/05/89. https://doi.org/10.1145/67544.66948

Efficient evaluation of right-, Left-, and Multi-Linear Rules. / Naughton, J. F.; Ramakrishnan, R.; Sagiv, Y. et al.
Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989. Association for Computing Machinery, 1989. p. 235-242 (Proceedings of the ACM SIGMOD International Conference on Management of Data; Vol. Part F130127).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient evaluation of right-, Left-, and Multi-Linear Rules

AU - Naughton, J. F.

AU - Ramakrishnan, R.

AU - Sagiv, Y.

AU - Ullman, J. D.

PY - 1989/6/1

Y1 - 1989/6/1

N2 - We present an algorithm for the efficient evaluation of a useful subset of recursive queries. Like the magic sets tranformation, the algorithm consists of a rewriting phase followed by semi-naive bottom-up evaluation of the resulting rules. We prove that on a wide range of recursions, this algorithm achieves a factor of 0(n) speedup over magic sets. Intuitively, the transformations in this algorithm achieve their performance by reducing the arity of the recursive predicates in the transformed rules.

AB - We present an algorithm for the efficient evaluation of a useful subset of recursive queries. Like the magic sets tranformation, the algorithm consists of a rewriting phase followed by semi-naive bottom-up evaluation of the resulting rules. We prove that on a wide range of recursions, this algorithm achieves a factor of 0(n) speedup over magic sets. Intuitively, the transformations in this algorithm achieve their performance by reducing the arity of the recursive predicates in the transformed rules.

UR - https://www.scopus.com/pages/publications/0346671875

U2 - 10.1145/67544.66948

DO - 10.1145/67544.66948

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0346671875

T3 - Proceedings of the ACM SIGMOD International Conference on Management of Data

SP - 235

EP - 242

BT - Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989

PB - Association for Computing Machinery

T2 - 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989

Y2 - 31 May 1989 through 2 June 1989

ER -

Naughton JF, Ramakrishnan R, Sagiv Y, Ullman JD. Efficient evaluation of right-, Left-, and Multi-Linear Rules. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989. Association for Computing Machinery. 1989. p. 235-242. (Proceedings of the ACM SIGMOD International Conference on Management of Data). doi: 10.1145/67544.66948

Efficient evaluation of right-, Left-, and Multi-Linear Rules

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this