Extracting unique rows of a bounded degree array using tries

Authors:
Douglas Comer
Affiliations:
Purdue University, West Lafayette, Indiana
Venue:
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Year:
1980

Citing 8
Cited 0

Pipelining: a technique for implementing data restructurers

ACM Transactions on Database Systems (TODS)
The UNIX time-sharing system

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM
Trie memory

Communications of the ACM
An Introduction to Database Systems

An Introduction to Database Systems
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
File searching using variable length keys

IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

An array with integer entries between 0 and d-1 has bounded degree d. This paper considers several algorithms for extracting the set of unique rows from a bounded degree array. For each algorithm considered, it gives the time, space, and I/O requirements, and an assessment of the types of applications for which the method is well-suited. It begins with four methods based on well known techniques and data structures, and goes on to propose a new algorithm which uses a form of digitial search tree known as a trie. It shows that the trie-based scheme has advantages over the other methods. Finally, it discusses some applications including computing a projection in a relational database system, and finding classes of isomorphic rows.