RECTANGULAR DECOMPOSITION HEURISTICS FOR DOCUMENTARY DATABASES

Authors
KHCHERIF R JAOUA A
Citation
R. Khcherif et A. Jaoua, RECTANGULAR DECOMPOSITION HEURISTICS FOR DOCUMENTARY DATABASES, Information sciences, 102(1-4), 1997, pp. 187-202
Citations number
12
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information sciences → ACNP
ISSN journal
00200255
Volume
102
Issue
1-4
Year of publication
1997
Pages
187 - 202
Database
ISI
SICI code
0020-0255(1997)102:1-4<187:RDHFDD>2.0.ZU;2-V
Abstract
This paper proposes a new algorithm for rectangular decompositon. Rect angular decomposition allows a classification of databases presented a s a binary relation; it has many applications in computer science, suc h as data knowledge engineering, signature files, and database cluster ing. Existing methods for rectangular decomposition are limited to res tricted relation sizes. A new algorithm for incremental rectangular de composition is developed for a documentary database, and its complexit y and cost analysis are presented. (C) Elsevier Science Inc. 1997.