Describes a hierarchical text database model and defines an algebra based on concordance lists. The algebra is presented as a theoretical model to define both a conceptual schema for the database and search protocols for database implementation. Several retrieval examples are included. (19 references) (MES)

Describes a prototype natural language text knowledge system (TKS) that was used to organize 50 pages of a handbook on artificial intelligence as an inferential knowledge base with natural language query and command capabilities. Representation of text, database navigation, query systems, discourse structuring, and future research needs are…

Proposes a new learning algorithm to improve the retrieval effectiveness of the search system used in the hypertext environment using an extended Boolean model with links to improve the ranking of retrieved items. Highlights include the basic retrieval scheme, the learning scheme, and a review of basic probabilistic retrieval models. (Contains 32…

Presents a database system development model in which theoretical support in the form of automated theorem proving is brought to bear on the problem of enforcing integrity, i.e., ensuring that the database system represents only those states and transitions that are possible in the world it models. (MBR)

HIT methodology for conceptual data structure design is briefly described and exemplified. Main features of the methodology are the natural formalism of the description of conceptual schema, and an easy-to-understand graphical way of communication between both the designer and individual experts substituting future users. (Author/MBR)

Identifies requirements for representing structural aspects of nonconventional information system applications and demonstrates how recursive data models support information systems better than record-based database modelling tools. Structural concepts for representing office data objects are discussed and applied to an office example. Language…

Reports on a project showing that relational data models, including unnormalized models that allow the nesting of relations, cannot fully capture the structural properties of lexical information. A feature-based model that allows for a full representation of some nesting and defines a factoring mechanism is described and demonstrated. (38…

Proposes a "Model of Querying" for users of office filing facilities and discusses its motivation, aspects, attributes, and advantages. A review of current information systems and attempts to combine information retrieval, artificial intelligence, and database management techniques leads to conclusion that no resultant system is adequate…

Describes a conceptual model for bibliographic data called Maestro (Management Environment for Structured Text Retrieval and Organization) that is being developed both to support structured documents in databases, and to provide a query language to link information contained in these structures. Traditional text retrieval systems are discussed,…

Describes the development of a structural model of document retrieval based on lexical-semantic relationships between index terms. An algorithm that uses tree-to-tree distance to measure structural closeness between a document and a query statement is explained, and the proposed model is compared to a vector retrieval model. (18 references) (LRW)

Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…

Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)

Describes a model for the workload of a full text retrieval system and of a simulation model for a version of an existing system called Full/Text. The effectiveness of various data caching strategies using the 2 models are explored, and the impact of various parameters on the strategies are evaluated. (13 references) (LRW)

Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)

Describes a conceptual model for integrating short scientific texts, which extends classical text storage and retrieval. A brief comparison with related approaches such as case-based reasoning and classification-based reasoning is also provided. (13 references) (Author/KRN)