Abstract
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, semantic networks, conceptual graphs, RETE, neural networks and case-based reasoning. Foundational to this view is that all data can be viewed as a primitive set of objects and mathematical relations (as sets of tuples) over those objects. The data is stored in three partially-ordered hierarchies: a node hierarchy, a relation hierarchy, and a conceptual graphs hierarchy. All three hierarchies can be stored as “levels” in the conceptual graphs hierarchy. These multiple hierarchies support multiple views of the data with advantages over any of the individual methods. In particular, conceptual graphs are stored in a relation-based compact form that facilitates matching. UDS is currently being implemented in the Peirce conceptual graphs workbench and is being used as a domain-independent monitor for state-space search domains at a level that is faster than previous implementations designed specifically for those domains.In addition it provides a useful environment for pattern-based machine learning.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.M. Barnard. Problems of substructure search and their solution. In Wendy Warr, editor, Chemical Structures the International Language of Chemistry,. Springer-Verlag, 1988.
H. Boley. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics with Applications, 23(6–9):601–638, 1992. Part 2 of Special Issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor.
G. Ellis. Compiled hierarchical retrieval. In E. Way, editor, Proceedings of Sixth Annual Workshop on Conceptual Structures), pages 187–208, SUNY-Binghamton, 1991. To Appear.
G. Ellis. Efficient retrieval from hierarchies of objects using lattice operations. In G. Mineau and B. Moulin, editors, Proceedings of First International Conference on Conceptual Structures (ICCS-93), Montreal, 1993. To Appear.
R. Elmasri and S.B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings, Redwood City, California, 2 edition, 1994.
S. Fahlman. NETL: A System for Representing and Using Real-World Knowledge. MIT Press, Massachusetts, 1979.
C.L. Forgy. Rete: A fast algorithm for the many pattern/many object patern match problem. Artificial Intelligence, 19(1):17–37, 1982.
J. Gould and R. Levinson. Experience-based adaptive search. In Machine Learning:A Multi-Strategy Approach, volume 4. Morgan Kauffman, 1992. To appear.
J.A. Hendler. Massively-parallel marker-passing in semantic networks. In Fritz Lehmann, editor, Semantic Networks in Artificial Intelligence, pages 277–292. Pergamon Press, 1992.
R. E. Korf. Planning as search. Artificial Intelligence, 1987.
R. Levinson. A self-organizing retrieval system for graphs. In AAAI-84, pages 203–206. Morgan Kaufman, 1984.
R. Levinson. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics with Applications, 23(6–9):573–600, 1992. Part 2 of Special Issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor. Also reprinted on pages 573–600 of the book, Semantic Networks in Artificial Intelligence, Fritz Lehmann, editor, Pergammon Press, 1992.
R. Levinson and G. Ellis. Multilevel hierarchical retrieval. Knowledge-Based Systems, 1992. To appear.
R. Levinson and Karplus K. Graph-isomorphism and experience-based planning. In D. Subramaniam, editor, Proceedings of Workshop on Knowledge Compilation and Speed-Up Learning, Amherst, MA., June 1993.
R. Levinson and R. Snyder. Adaptive pattern oriented chess. In Proceedings of AAAI-91, pages 601–605. Morgan-Kaufman, 1991.
R.A. Levinson. Exploiting the physics of state-space search. In Proceedings of AAAI Symposium on Games:Planning and Learning, pages 157–165. AAAI Press, 1993.
D. P. Miranker. Treat: A better match algorithm for ai production systems. In Proceedings of AAAI-87, pages 42–47, 1987.
D.D. Roberts. The existential graphs. In Semantic Networks in Artificial Intelligence, pages 639–664. Roberts, 1992.
E. Sciore. A complete axiomatization for join dependencies. JACM, 29(2):373–393, April 1982.
J. F. Sowa. Conceptual Structures. Addison-Wesley, 1983.
P. Suppes. Models of data. In Logic, Methodology and Philosophy of Science, pages 252–261. Stanford, East Lansing, 1962.
J.D. Ullman. The u.r. strikes back. In Proceedings of the ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 10–22, 1982.
S. Watanabe. Pattern Recognition:Human and Mechanical. Wiley, New York, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levinson, R. (1994). UDS: A universal data structure. In: Tepfenhart, W.M., Dick, J.P., Sowa, J.F. (eds) Conceptual Structures: Current Practices. ICCS 1994. Lecture Notes in Computer Science, vol 835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58328-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-58328-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58328-8
Online ISBN: 978-3-540-38675-9
eBook Packages: Springer Book Archive