Speeding up the Counting Method by Computing Heritage Functions in Topological Order

In this paper, an optimal method for evaluating linear recursive datalog queries is proposed. The method is based on the concepts of so-called heritage appearance function and heritage selection function. By computing such functions in topological order, a counting-like strategy can be implemented, which requires only linear time for non-cyclic data.

Content

Author and article information

Conference

Publication date: September 1997

Publication date (Print): September 1997

Pages: 1-16

Affiliations

[0001]Department of Computer Science, TU Chemnitz-Zwickau, 09107 Chemitz, Germany

Article

DOI: 10.14236/ewic/ADBIS1997.12

SO-VID: 02c84dfc-60d9-4507-9328-2ebc053095fd

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the First East-European Symposium on Advances in Databases and Information Systems

Conference acronym: ADBIS

Conference number: 1

Conference location: St Petersburg

Conference date: 2-5 September 1997

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Advances in Databases and Information Systems

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/ADBIS1997.12

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Speeding up the Counting Method by Computing Heritage Functions in Topological Order

Abstract