Relational Information Systems
Relational Information Systems
Communications of the ACM
A general implementation of relational recursion with speedup techniques for programmers
Information Processing Letters
Relixpert—an expert system shell written in a database programming language
Data & Knowledge Engineering
Trie methods for text and spatial data on secondary storage
Trie methods for text and spatial data on secondary storage
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Some high level language constructs for data of type relation
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
A fast string searching algorithm
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Communications of the ACM
Remarks on the algebra of non first normal form relations
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Trie Methods for Representing Text
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Persistent First Class Procedures are Enough
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Attribute Metadata for Relational OLAP and Data Mining
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Low level structures in the implementation of the relational algebra
Low level structures in the implementation of the relational algebra
Trie methods for structured data on secondary storage
Trie methods for structured data on secondary storage
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
IBM Systems Journal
Relational languages for metadata integration
ACM Transactions on Database Systems (TODS)
The Peterlee relational test vehicle: a system overview
IBM Systems Journal
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Hi-index | 0.00 |
Despite its immense success, the relational model of data has been underappreciated. Many wrong claims have been made to the effect that it is unable to handle complex data, to do analytical processing, or to go beyond passe, simple structured data. I have devoted most of a career in computer science to showing that relations can indeed cope with all these, without awkwardness and with minimal syntactic and conceptual extensions. Not only can relations cope; they do the job better. A further advantage of this work is integration: the same formalism that was classically used for administrative data can also be used for expert systems, for geographical information systems, for CAD-CAM, for numerical work, for data mining and for semistructured applications such as bibliographic and bioinformatic databases. Another advantage is that this integrated relational formalism is at a level of abstraction which is not only ideally suited for processing data on secondary storage but which also readily absorbs important issues in computational parallelism and in distributing data over the Internet. I review the simple ideas needed to push the relational model to its inherent full capabilities, and show the syntactic adjustments needed to avoid the limitations of conventional and commercial implementations. The discussion is prefaced by some motivating examples, without full explanations, and terminated by a consideration of some special techniques for implementing the language constructs.