Multidimensional Index Structures in Relational Databases
Journal of Intelligent Information Systems - Data warehousing and knowledge discovery
Fundamentals of Data Structures in C++
Fundamentals of Data Structures in C++
Introduction to Algorithms
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
The representation and inferences of hierarchies
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Realization of natural language interfaces using lazy functional programming
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
For knowledge systems that rely on teachings from an outside source to gain their knowledge, proper data organizations are instrumental in managing and applying what has been learned. This paper describes the development of a Multi-Dimensional Data Organization (MDDO). Our MDDO stores a collection of knowledge of the same category classified by multiple orthogonal dimensions. Each dimension has a number of indices reflecting the potential attribute values of that dimension. A knowledge object is identified by a unique combination of indices from multiple dimensions whose values signify the different properties of the object itself. Our solution allows the collection of knowledge to be learned dynamically in any order and in an incremental manner. This MDDO has been used to store part of the English grammar, and we describe in this paper how it assists a learning program in both the parsing and the production of an English sentence. We also define the functionalities of the data organization, describe its organization, describe how each function is implemented, and analyze their worst-case performances.