Query processing in Relationlog

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Relationlog is a persistent deductive database system that supports effective storage, efficient access and inference of large amounts of data with complex structures. In this paper, we describe query processing in the Relationlog system. In particular, we illustrate the extended semi-naive and magic-set techniques used in Relationlog.

Cite

CITATION STYLE

APA

Liu, M. (1999). Query processing in Relationlog. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1677, pp. 342–351). Springer Verlag. https://doi.org/10.1007/3-540-48309-8_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free