Abstract
Formal methods for an automatical extraction of secondary information from primary and usage information are described. Two related aspects are discussed:
-
(1)
Catalogues describing primary data shall be extended by selected ‘important’ or ‘characteristical’ data items and relations between them for an overview on the data files.
-
(2)
Performance in the execution of powerful functions shall be improved by more sophisticated internal secondary (index) data, suitable also for textual fields in formated data base systems. Basic underlying algorithms are tested. Experiments in several applications are presented.
Fachtagung der FG ‚Formale Modelle für Informationssysteme‘ der GI, Tutzing, Mai 1979.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Aho, A. V.; Corasick, M.: Efficient String Matching: An Aid to Bibliographic Search. Com. ACM, Juni 1975, Vol. 18, Nr. 6.
Bockstein, A.: On Harrison’s Substring Testing Technique. Com. of ACM, März 1973, Vol. 16, Nr. 3, pp. 180–181.
Boyer, R. S.; Moore, J. S.: A Fast String Searching Algorithm. Com. of the ACM, Vol. 20, Nr. 10, 1977, pp. 262–272.
Breyer, E.: Automatische Klassifikation von Nachrichten mit der Referenzstring Methode. Diplomarbeit Universität Darmstadt, März 1979.
Commentz-Walter, B.: A String Matching Algorithm Fast on the Average. To appear in Lecture Notes in Comp. Sc. Proc. on ICALP, 6th Call., Graz, July 1979.
Erbe, R.; Walch, G.:A General interactive Guidance for Information Retrieval and Processing Systems. APL 76: Conference Proceedings.
Harrison, M.C.: Implementation of Substring Test by Hashing. Comm. of ACM, Dec. 71, Vol. 14, No. 12, pp. 777–779.
Lynch, M. F.: Variety Generation — A Reinterpretation of Shannon’s Mathematical Theory of Communication, and its Implications for Information Science. Journal of ACM, Jan. 77, pp. 19–25.
Schuegraf, E.J.; Heaps, H. S.: Query Processing in a Retrospective Document Retrieval System that Uses Word Fragments as Language Elements. Information Processing and Management, Vol. 12, pp. 283–292.
Schek, H.-J.: The Reference String Indexing Method. Information System Methodology (ed. G. Bracchi, P. Lockemann). Lecture Notes in Computer Science, Vol. 65, Springer Heidelberg 1978, pp. 432–459.
Williams, P. W.: Criteria for Choosing Subsets to Obtain Maximum Relative Entropy. The Computer Journal, Vol. 21, No. 1, pp. 57–62.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Commentz-Walter, B., Schek, HJ. (1979). Methoden und Algorithmen zur automatischen Informationsverwaltung. In: Mayr, H.C., Meyer, B.E. (eds) Formale Modelle für Informationssysteme. Informatik-Fachberichte, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67485-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-67485-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09773-0
Online ISBN: 978-3-642-67485-3
eBook Packages: Springer Book Archive