| |
 |
Data processing system and method for retrieving and entity specified in a search path record from a relational database |
| RE40526 |
Data processing system and method for retrieving and entity specified in a search path record from a relational database
|
|
| Patent Drawings: | |
| Inventor: |
Doktor |
| Date Issued: |
September 30, 2008 |
| Application: |
11/152,833 |
| Filed: |
June 14, 2005 |
| Inventors: |
Doktor; Karol (Wheelers Hill, AU)
|
| Assignee: |
Financial Systems Technology (Intellectual Property) Pty Ltd (Malvern, Victoria, AU) |
| Primary Examiner: |
Wassum; Luke S |
| Assistant Examiner: |
|
| Attorney Or Agent: |
Allen, Dyer, Doppelt, Milbrath & Gilchrist, P.A. |
| U.S. Class: |
707/2 |
| Field Of Search: |
|
| International Class: |
G06F 17/30; G06F 7/00 |
| U.S Patent Documents: |
|
| Foreign Patent Documents: |
WO 00/07354; WO 01/15811 |
| Other References: |
Tsichritzis, D. "LSL: A Link and Selector Language", Proceedings of the ACM-SIGMOD International Conference on Management of Data, Jun. 2-4,1976, pp. 123-133. cited by examiner.
Munz, R. "The Well System: A Multi-User Database System Based on Binary Relationships and Graph-Pattern-Matching", Information Systems, vol. 3, 1978, pp. 99-115. cited by examiner.
Munz, R. "Design of the Well System", in Entity-Relationship Approach to Systems Analysis and Design, Proceedings of the 1.sup.st International Conference on the Entity-Relationship Approach, Chen, P. ed., 1979, pp. 502-522. cited by examiner.
Rybinski, H. "On First-Order-Logic Databases", ACM Transactions on Database Systems (TODS), vol. 12, No. 3, Sep. 1997, pp. 325-349. cited by examiner.
Stonebraker, M. and J.M. Hellerstein "What Goes Around Comes Around", in Readings in Database Systems 4.sup.th Edition, Caimbridge:MIT Press, Jan. 2005, ISBN 0-262-69314-3. cited by examiner.
Curran, T. "EE221--Database Systems & Software Analysis and Design", course notes, Dublin City University, School of Electronic Engineering, downloaded from www.eeng.dcu.ie/-ee221/EE221-DB-2.pdf, 2007. cited by examiner.
Microsoft Corporation, "Relational Database Components", tutorial, downloaded from msdn.microsoft.com/en-us/library/aa174501(SQL.80).aspx, 2007. cited by examiner.
Microsoft "Microsoft Press Computer Dictionary, Third Edition", Redmond:Microsoft Press, pp. 403-404, 1997. ISBN 1-57231-446-X, QA76.15.M54 1997. cited by examiner.
Daniel R. Dolk, et. al., A Relational Information Resource Dictionary System, Computing Practices, Communications of the ADM (Jan. 1987). cited by other.
M.M. Zloof, Query-by-Example: A Data Base Language, IBM Systems Journal, No. 4 (1977). cited by other.
Ashok Malhotra, Yakov Tsalalikhin, Donald P. Pazel, Luanne M. Burns and Harry M. Markowitz, Implementing an Entity-Relationship Language on a Relational Data Base, IBM Research Report RC 12134 (#54499) (Aug. 27, 1986) ("Malhotra"). cited by other.
Rudolph Munz, "Das WEB-Modell" (translated pages), pp. 155-156, Fig. 10.2.1, (1976). ("Munz 111"), with English translation. Document Provided Doesn't Match. cited by other.
Gio Wiederhold, "Database Design Second Edition", Discloses Definition Tables, Sections 7-3-1, 7-3-7, 7-4-4, 7-4-5, and 9-7-6 and Figs. 8-5, 8-7, 8-9 (1995). cited by other.
Pin-Shan Chen, The entity-relationship model--A basis for the enterprise view of data 77 (1977). cited by other.
Mark L. Gillenson, Database Step-by-step 141-42, 2d Ed. (1990). cited by other.
The IBM Dictionary of Computing Terms (8th Ed. 1987), p. 107. cited by other.
Webster's New World Dictionary of Computer Terms (3d Ed. 1988), pp. 87-88. cited by other.
Rudolph Munz, "Das WEB-Modell" (English translated pages), Chapter 10 (1976), 18 pages. cited by other.
Introduction to NonStop SQL, Tandem Computers, May 1988, pp. I--3-19. cited by other.
Fishman et al., "Overview of the Iris DBMS", Association for Computing Machinery, Inc., pp. 219-250. cited by other.
Halper et al., "An OODB "Part" Relationship Model", 10 pages. cited by other.
Kim et al., "Features of the ORION Object-Oriented Database System", pp. 251-282. cited by other.
Kim et al., "Evaluation of the Object-relational DBMS Postgres .I. Administrative Data", Computing Science, Oct. 1994, pp. 1-52. cited by other.
Banerjee et al., "Data Model Issues for Object-Oriented Applications", ACM Transactions on Office Information Systems, vol. 5, No. 1, Jan. 1987, pp. 3-26. cited by other.
Blakely et al., "Experience Buildig the Open OODB Query Optimizer", 1993, pp. 287-296. cited by other.
Markowitz et al., "Representing Extended Entity-Relationship Structures in Relational Databases: A Modular Approach", ACM Transactions on Office Information Systems, vol. 17, No. 3, Sep. 1992, pp. 423-464. cited by other.
Teorey et al., "A Logical Design Methodology for Relational Databases Using the Extended Entity-Relationship Model", Computing Surveys, vol. 18, No. 2, Jun. 1986, pp. 197-222. cited by other.
Chen, Peter, "Entity-Relationship Approach to Systems Analysis and Design", Proceedings of the International Conference in Los Angeles, Dec. 10-12, 1979, pp. 237-257. cited by other.
Blakeley et al., "Experiences Building the Open OODB Query Optimizer", 1993, pp. 287-296. cited by other.
Zand et al., "A Survey of Current Object-Oriented Databases", Data Base Advances, Feb. 1995, vol. 26, No. 1, pp. 14-29. cited by other.
Straube et al., "Queries and Query Processing in Object-Oriented Database Systems", ACM Transactions on Information Systems, vol. 8, No. 4, Oct. 1990, pp. 387-430. cited by other.
Kim et al., "Semantics and Implementation of Schema Evolution in Object-Oriented Databases", 1987, pp. 311-322. cited by other.
Kim et al., "Composite Object Support in an Object-Oriented Database System", OOPSLA '87 Proceedings, Oct. 4-8, 1987, pp. 118-125. cited by other.
Hull et al., "Semantic Database Modeling: Survey, Applications, and Research Issues", ACM Computing Survey, vol. 19, No. 3, Sep. 1987, pp. 201-260. cited by other.
Nixon et al., "Implementation of a Compiler for a Semantic Data Model: Experiences with Taxis", 1987, pp. 118-131. cited by other.
Codd, E., "Extending the Database Relational Model to Capture More Meaning", ACM Transactions on Database Systems, vol. 4, No. 4, Dec. 1979, pp. 397-434. cited by other.
Peckham et al., "Semantic Data Models", Acm Computing Surveys, vol. 20, No. 3, Sep. 1988, pp. 153-189. cited by other.
Tsurt et al., "An Implementation of GEM--supporting a semantic data model on a relational back-end.", 1984, pp. 286-295. cited by other.
Wilkinson et al., "The Iris Architecture and Implementation", IEEE Transactions on Knowledge and Data Engineering, vol. 2, No. 1, Mar. 1990, 27 pages. cited by other.
Gamache et al., "Addressing Techniques Used in Database Object managers O.sub.2 and Orion", SIGMOD Record, vol. 24, No. 3, Sep. 1995, pp. 50-55. cited by other.
Kim et al., "Architecture of the Orion Next-Generation Database System", IEEE, 1990, pp. 109-124. cited by other.
Klimbie et al., "Data Base Management", North-Holland Publishing Company, 1974, pp. 1-59. cited by other.
Hudson et al., "Cactis: A Self-Adaptive, Concurrent Implementation of an Object-Oriented Database Management System", ACM Transactions on Database Systems, vol. 14, No. 3, Sep. 1989, pp. 291-321. cited by other.
Annevelink et al., "Object SQL--A Language for the Design and Implementation of Object Databases", Jan. 3, 1994, pp. 1-21. cited by other.
Chen, P., "Entity-Relationship Approach to Information Modeling and Analysis", International Conference in Washington, D.C., Oct. 12-14. 1981, pp. 49-72. cited by other.
Wiederhold, G., "Database Design Appendix B", McGraw-Hill, 2001, pp. 689-698. cited by other.
Cattell, R. and Rogers, T., "Combining Object-Oriented and Relational Models of Data", 1986 International Workshop on Sep. 26, 1986, pp. 212-213. cited by other.
Rumbaugh, J., "Relations as Semantic Constructs in an Object-Oriented Language", OOPSLA '87 Proceedings, Oct. 4-8, 1987, pp. 466-481. cited by other.
Dewan et al. "Engineering the Object-Relation Database Model in O-Raid", Lecture Notes in Computer Science, 3.sup.rd International Conference--Paris, Jun. 21-23, 1989, pp. 389-403. cited by other.
Blaha et al., "Relational Database Design using an Object-Oriented Methodology", Communications of the ACM, Apr. 1988, vol. 31, No. 4, pp. 414-427. cited by other.
Wiederhold, G., "Views, Objects, and Databases" Computer Database Architecture, Dec. 1986, pp. 37-44. cited by other.
Mark et al., "Metadata Management", Computer Database Architecture, Dec. 1986, pp. 26-36. cited by other.
Osborn et al., "The Design of a relational Database System with Abstract Data Types for Domains", ACM Transactions on Database Systems, vol. 11, No. 3, Sep. 1986, pp. 357-373. cited by other.
Whang et al., "Query Optimization in a Memory-Resident Domain Relational Calculus Database System", ACM Transactions on Database Systems, vol. 15, No. 1, Mar. 1990, pp. 67-95. cited by other.
Finkelstein et al., "Physical Database Design for Relational Databases", ACM Transactions on Database Systems, vol. 13, No. 1, Mar. 1988, pp. 91-128. cited by other.
Takahashi, J., "Hybrid Relations for Database Schema Evolution", IEEE, 1990, pp. 465-470. cited by other.
Khoshaflan, S. and Copeland, G., "Object Identity", Microelectronics and Computer Technology Corporation, pp. 37-46. cited by other.
Rowe, L. and Stonebraker, M. "The POSTGRES Data Model", Computer Science Division, EECS Department, University of California, pp. 1-21. cited by other.
Stonebraker, M. and Moore, D., "Object-Relational DBMSs The Next Great Wave", Morgan Kaufman Publishers, Inc., 1996, pp. 56-61. cited by other.
Howcroft, "Contemporary issues in UK bank delivery systems", Inter. Jour. of Service Industry Management, vol. 3, No. 1, pp. 39-56, ISBN 096-4223, 1992. cited by other.
"The Smart Card's Chief Advocate", Credit Card Management, vol. 10, No. 1, p. 26+, ISBN: 0896-9329, 1992. cited by other.
Bharadwaj et al., Determinants of success in service industries: a PIMS-based empirical investigation, Journal of Service Marketing, v7n4, pp. 19-40, 1993, 23 pages from Dialog file 15, acc. # 00813287. cited by other.
Rose, Peter S., et al. Financial Institution, Understanding and Managing Financial Services, 4th Edition, Richard D. Irwin, Inc., 1993. pp. 1-217; 328-356; 423-446; 654-792. cited by other.
Parsaye, Kamran & Chignell, Mark. Expert Systems For Experts. John Wiley & Sons. 1988. pp. 35-60, 177-178, 191-210 and 295-309. cited by other.
Hendler, James A. Expert Systems: The User Interface. Albex Publishing Corporation. Norwood, NJ. 1988. pp. 31, 46-47, 109-110, 113 and 132-134. cited by other.
Hanks, D.R., "The Payoff of Modest Price Adjustments," (Abstract only), Bank Marketing, vol. 12, No. 9, p. 13,, Sep. 1980. cited by other.
Stuchfield, N., et al., "Modeling of Profitability of Customer Relationships: Development and Impact of Barclays de Zoete Wedd's Beatrice," Journal of Management Information Systems, vol. 9, No. 2, p. 53, Fall 1992. cited by other.
Korth and Silberschatz, Database System Concepts, McGraw-Hill Book Company (New York, 1986), pp. 45-105; pp. 301-323. cited by other.
"Extended Disjunctive Normal Form for Efficient Processing of Recursive Logic Queries", IBM Technical Disclosure Bulletin, vol. 30, No. 1, Jun. 1987 pp. 360-366. cited by other.
Yu et al, "Automatic Knowledge Acquisition and Maintenance For Semantic Query Optimization", IEEE Transactions on Knowledge and Data Engrn, V:1, No. 3 Sep. 1989, pp. 362-375. cited by other.
Kifer et al, "Sygraf: Implementing Logic Programs in a Database Style" IEEE Transactions on Software Engnrn. v:14, N7, Jul. 1988 pp. 92-935. cited by other.
El-Sharkawi et al, "The Architecture and Implementation of Enli: An Example-Based Natural Language Assisted Interface", Parbase 90 Intl. Conf. on Databases, Parallel Architectures & Their Applications, Mar. 7-9 1990. cited by other.
Wilschut et al, "Pipelining in Query Execution" Parbase-90 Intl. Conf. on Databases, Parallel Architectures and Their Applications, Mar. 7-9, 1990 p. 562. cited by other.
Adiba et al., "Database Snapshots", Proceedings of the 1980 International Conference on Very Large Data Bases, IEEE 1980, pp. 86-91. cited by other.
Blakeley et al., "Join Index, Materialized View, and Hybrid-Hash Join: A Performance Analysis", Technical Report No. 280, Indiana University Computer Science Department, IEEE 1990, pp. 256-263. cited by other.
Elmasri et al., "Fundamentals Of Database Systems", 1989. cited by other.
Hainaut, J. L., "Theoretical And Practical Tools For Data Base Design", Proceedings of the Seventh International Conference on Very Large Data Bases, IEEE 1981, pp. 215-224. cited by other. |
|
| Abstract: |
A relationships processing computing system provides for the recording and extraction of data objects (entities) and for development data representing a queried relationship between data objects (entities). The set of entities and relationships may be expanded at any time during the life of the system without reprogramming or compiling computer code and without disrupting concurrent use of the system. Complex inquiries, normally requiring multiple nested queries, may be performed without code level programming. |
| Claim: |
What is claimed is:
1. In a computer system, a data processing system for retrieving a selected entity from a relational database, said data processing system comprising: memory means containinga plurality of entities, wherein said entities are part of said relational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first entity and a firstrelation, and said first search path record storing means includes an inquiry definition table means; means, operatively coupled to said first search path record storing means, for retrieving from said relational database a second entity wherein saidsecond entity is related to said first entity by said first relation; means, operatively coupled to said memory means, for storing a second search path record wherein said second search path record identifies a second relation, and said second searchpath record storing means includes said inquiry definition table means; and means, operatively coupled to said second search path record storing means and to said second entity retrieving means, for retrieving from said relational database said selectedentity wherein said selected entity is related to said second entity by said second relation.
2. In a computer system, a data processing system for retrieving a selected entity from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein said entities are part of saidrelational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first entity and a first relation; means, operatively coupled to said first search pathrecord storing means, for retrieving from said relational database a second entity wherein said second entity is related to said first entity by said first relation; means, operatively coupled to said memory means, for storing a second search pathrecord wherein said second search path record identifies a second relation; means, operatively coupled to said second search path record storing means and to said second entity retrieving means, for retrieving from said relational database said selectedentity wherein said selected entity is related to said second entity by said second relation; and means, operatively coupled to said second entity retrieving means and to said selected entity retrieving means, for storing said second entity in anabbreviated results gathering means.
3. In a computer system, a data processing system for retrieving a selected group of one or more entities from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein said entitiesare part of said relational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first entity and a first relation, and said first search path record storingmeans includes an inquiry definition table means; means, operatively coupled to said first search path record storing means, for retrieving from said relational database a first group of entities comprising all entities within said relational databaserelated to said first entity by said first relation; means, operatively coupled to said memory means, for storing a second search path record wherein said second search path record identifies a second relation, and said second search path record storingmeans includes said inquiry definition table means; and means, operatively coupled to said second search path record storing means and to said first group of entities retrieving means, for retrieving from said relational database said selected group ofone or more entities wherein said selected group of one or more entities comprises all entities within said relational database related to at least one of said first group of entities by said second relation.
4. In a computer system, data processing system for retrieving a selected group of one or more entities from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein said entitiesare part of said relational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first entity and a first relation; means, operatively coupled to said firstsearch path record storing means, for retrieving from said relational database a first group of entities comprising all entities within said relational database related to said first entity by said first relation; means, operatively coupled to saidmemory means, for storing a second search path record wherein said second search path record identifies a second relation; means, operatively coupled to said second search path record storing means and to said first group of entities retrieving means,for retrieving from said relational database said selected group of one or more entities wherein said selected group of one or more entities comprises all entities within said relational database related to at least one of said first group of entities bysaid second relation; and means, operatively coupled to said first group of entities retrieving means and to said selected group of one or more entities retrieving means, for storing said first group of entities in an abbreviated results gatheringmeans.
5. A computer method for retrieving a selected entity from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first entity and a first relation; retrieving fromsaid relational database in response to said first search path record a second entity wherein said second entity is related to said first entity by said first .[.relating.]. .Iadd.relation.Iaddend.; forming a second search path record wherein saidsecond search path record identifies a second relation; retrieving from said relational database in response to said second search path record said selected entity wherein said selected entity is related to said second entity by said second relation; and storing said first search path record and said second search path record in an inquiry definition table means.
6. A computer method for retrieving a selected entity from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first entity and a first relation; retrieving fromsaid relational database in response to said first search path record a second entity wherein said second entity is related to said first entity by said first relation; forming a second search path record wherein said second search path recordidentifies a second relation; retrieving from said relational database in response to said second search path record said selected entity wherein said selected entity is related to said second entity by said second relation; and storing said secondentity in an abbreviated results gathering means.
7. A computer method for retrieving a selected group of one or more entities from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first entity and a firstrelation; retrieving from said relational database a first group of entities comprising all entities within said relational database related to said first entity by said first relation; forming a second search path record wherein said second searchpath record identifies a second relation; retrieving from said relational database said selected group of entities wherein said selected group of entities comprises all entities within said relational database related to at least one of said first groupof entities by said second relation; and storing said first search path record and said second search path record in an inquiry definition table means.
8. A computer method for retrieving a selected group of one or more entities from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first entity and a firstrelation; retrieving from said relational database a first group of entities comprising all entities within said relational database related to said first entity by said first relation; forming a second search path record wherein said second searchpath record identifies a second relation; retrieving from said relational database said selected group of entities wherein said selected group of entities comprises all entities within said relational database related to at least one of said first groupof entities by said second relation; and storing said first group of entities in an abbreviated results gathering means.
9. In a computer system, a data processing system for retrieving a selected entity from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein said entities are part of saidrelational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first relation, and said first search path record storing means includes an inquirydefinition table means; means, operatively coupled to said first search path record storing means, for retrieving from said relational database a first entity wherein said first entity is related to a second entity by said first relation; means,operatively coupled to said memory means, for storing a second search path record wherein said second search path record identifies a second relation, and said second search path record storing means includes said inquiry definition table means; andmeans, operatively coupled to said second search path record storing means and to said first entity retrieving means, for retrieving from said relational database said selected entity wherein said selected entity is related to said first entity by saidsecond relation.
10. In a computer system, a data processing system for retrieving a selected group of one or more entities from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein saidentities are part of said relational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first relation, and said first search path record storing meansincludes an inquiry definition table means; means, operatively coupled to said first search path record storing means, for retrieving from said relational database a first group of entities comprising all entities within said relational database relatedto at least one of said entities by said first relation; means, operatively coupled to said memory means, for storing a second search path record wherein said second search path record identifies a second relation, and said second search path recordstoring means includes said inquity definition table means; and means, operatively coupled to said second search path record storing means and to said first group of entities retrieving means, for retrieving from said relational database said selectedgroup of one or more entities wherein said selected group of one or more entities comprises all entities within said relational database related to at least one of said first group of entities by said second relation.
11. A computer method for retrieving a selected entity from a relation database, said method comprising: forming a first search path record wherein said first search path record identifies a first relation; retrieving from said relationaldatabase in response to said first search path record a first entity wherein said first entity is related to a second entity by said first relation; forming a second search path record wherein said second search path record identities a second relation; retrieving from said relational database in response to said second search path record said selected entity wherein said selected entity is related to said first entity by said second relation; and storing said first search path record and said secondsearch path record in an inquiry definition table means.
12. A computer method for retrieving a selected group of one or more entities from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first relation; retrievingfrom said relational database a first group of entities comprising all entities within said relational database related to at least one of said entities by said first relation; forming a second search path record wherein said second search path recordidentifies a second relation; retrieving from said relational database said selected group of entities wherein said selected group of entities comprises all entities within said relational database related to at least one or said first group of entitiesby said second relation; and storing said first search path record and said second search path record in an inquiry definition table means.
13. In a computer system, a data processing system for retrieving a selected entity from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein said entities are part of saidrelational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first relation; means, operatively coupled to said first search path record storing means,for retrieving from said relational database a first entity wherein said first entity is related to a second entity by said first relation; means, operatively coupled to said memory means, for storing a second search path record wherein said secondsearch path record identities a second relation; means, operatively coupled to said second search path record storing means and to said first entity retrieving means, for retrieving from said relational database said selected entity wherein saidselected entity is related to said first entity by said second relation; and means, operatively coupled to said first entity retrieving means and to said selected entity retrieving means, for storing said first entity in an abbreviated results gatheringmeans.
14. In a computer system, a data processing system for retrieving a selected group of one or more entries from a relational database, said data processing system comprising: memory means containing a plurality of entities, wherein said entitiesare part of said relational database; means, operatively coupled to said memory means, for storing a first search path record wherein said first search path record identifies a first relation; means, operatively coupled to said first search path recordstoring means, for retrieving from said relational database a first group of entities comprising all entities within said relational database related to at least one of said entities by said first relation; means, operatively coupled to said memorymeans, for storing a second search path record wherein said second search path record identifies a second relation; means, operatively coupled to said second search path record storing means and to said first group of entities retrieving means, forretrieving from said relational database said selected group of one or more entities wherein said selected group of one or more entities comprises all entities within said relational database related to at least one of said first group of entities bysaid second relation; and means, operatively coupled to said first group of entities retrieving means and to said selected group of one or more entities retrieving means, for storing said first group of entities in an abbreviated results gatheringmeans.
15. A computer method for retrieving a selected entity from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first relation; retrieving from said relationaldatabase in response to said first search path record a first entity wherein said first entity is related to a second entity by said first relation; forming a second search path record wherein said second search path record identifies a second relation; retrieving from said relational database in response to said second search path record said selected entity wherein said selected entity is related to said first entity by said second relation; and storing said first entity in an abbreviated resultsgathering means.
16. A computer method for retrieving a selected group of one or more entities from a relational database, said method comprising: forming a first search path record wherein said first search path record identifies a first relation; retrievingfrom said relational database a first group of entities comprising all entities within said relational database related to at least one of said entities by said first relation; forming a second search path record wherein said second search path recordidentifies a second relation; retrieving from said relational database said selected group of entities wherein said selected group of entities comprises all entities within said relational database retalted to at least one of said first group ofentities by said second relation; and storing said first group of entities in abbreviated results gathering means. |
| Description: |
|
|
|
|
