A straightforward NF 2 relational interface with applications in information retrieval

Abstract In information retrieval (IR) there is a need for greater structural expressiveness than that provided by ordinary retrieval systems or the ordinary relational model. Especially hierarchical structures are usual in IR applications. Therefore the non-first-normal-form (NF2) relational model often is a more natural and intuitive way to model data of IR applications than the pure relational model. Because many-to-many relationships often exist among real world entities of IR applications, it is impossible to find a stable hierarchical structure suitable to all needs of users. This means that a tool is needed that has a powerful restructuring capability. In other words, it has to be able to produce for the user result NF2 relations in which hierarchical relationships among data have been organized in a way that is drastically different from that in the source NF2 relations. In this paper we classify typical data restructuring tasks in an IR environment, and give several examples on their specifications. It has been widely recognized that NF2 relational query formulation with conventional query languages is too cumbersome for ordinary end users. In order to simplify NF2 relational query formulation, we have developed and implemented a novel user interface. We show that query specification in this interface remains compact and truly declarative—also in the context of complex NF2 relational queries.

[1]  Robert G. Crawford The relational model in information retrieval , 1981, J. Am. Soc. Inf. Sci..

[2]  Timo Niemi,et al.  An Entity-Based Approach to Query Processing in Relational Databases. Part II: Entity Query Construction and Updating , 1993, Data Knowl. Eng..

[3]  Timo Niemi A seven-tuple representation for hierarchical data structures , 1983, Inf. Syst..

[4]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[5]  Dirk Van Gucht,et al.  Converting nested algebra expressions into flat algebra expressions , 1992, TODS.

[6]  Henry F. Korth,et al.  SQL/NF: a query language for ¬1 NF relational databases , 1987, Inf. Syst..

[7]  Joost Kircz,et al.  The use of relational databases for electronic and conventional scientific publishing , 1987, J. Inf. Sci..

[8]  Henry F. Korth Optimization of Object-Retrieval Queries , 1988, OODBS.

[9]  C. J. Date A critique of the SQL database language , 1984, SGMD.

[10]  Timo Niemi,et al.  An Entity-Based Approach to Query Processing in Relational Databases. Part I: Entity Type Representation , 1993, Data Knowl. Eng..

[11]  Abraham Silberschatz,et al.  Extended algebra and calculus for nested relational databases , 1988, TODS.

[12]  Bipin C. Desai,et al.  Non-first normal form universal relations: an application to information retrieval systems , 1987, Inf. Syst..

[13]  Robert N. Oddy,et al.  Information Retrieval Research , 1982 .

[14]  Hans-Jörg Schek,et al.  The relational model with relation-valued attributes , 1986, Inf. Syst..

[15]  Vincent Y. Lum,et al.  Specification of Forms Processing and Business Procedures for Office Automation , 1982, IEEE Transactions on Software Engineering.

[16]  Timo Niemi,et al.  Operation-oriented query language approach for recursive queries - Part 2. Prototype implementation and its integration with relational databases , 1992, Inf. Syst..

[17]  Timo Niemi,et al.  Operation-oriented query language approach for recursive queries - Part 1. Functional definition , 1992, Inf. Syst..

[18]  Ian A. Macleod,et al.  Storage and retrieval of structured documents , 1990, Inf. Process. Manag..

[19]  Terrence A. Brooks Repetitive bibliographical information in relational databases , 1988 .