Easily expandable data processing system and method

Details Easily expandable data processing system and method Easily expandable data processing system and method

2005-06-14

2008-09-23

Wassum, Luke S (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reissue Patent

active

RE040520

ABSTRACT:
Machine automated techniques are described for a method of data processing called Relationships Processing. A computing system is disclosed which provides for the high speed recording and extraction of data objects (entities) and for the development data representing a queried relationship between the entities. The system is expandable to handle the relatively voluminous data bases of large, commercial data repositories. A user defines set of entities and allowed relationships between the entities. The user can expand this set of allowed entities and relationships at any time during the life of the system without reprogramming or compiling of computer program code or disrupting concurrent operational use of the system. Large systems can now be built that are no longer limited to a scope of design requirements known during initial systems development. For a given set of defined relationships the system allows the user to perform complex inquiries (again without programming at the code level) that would normally require multiple nested inquiries to be coded programmatically and would not achieve the performance levels of the Relationships Processor.

REFERENCES:
patent: 3618027 (1971-11-01), Feng
patent: 3670310 (1972-06-01), Bharwani et al.
patent: 4068300 (1978-01-01), Bachman
patent: 4128891 (1978-12-01), Lin et al.
patent: 4497039 (1985-01-01), Kitakami et al.
patent: 4498145 (1985-02-01), Baker et al.
patent: 4506326 (1985-03-01), Shaw et al.
patent: 4575798 (1986-03-01), Lindstrom et al.
patent: 4631664 (1986-12-01), Bachman
patent: 4670848 (1987-06-01), Schramm
patent: 4774661 (1988-09-01), Kumpati
patent: 4791561 (1988-12-01), Huber
patent: 4807122 (1989-02-01), Baba
patent: 4829427 (1989-05-01), Green
patent: 4855908 (1989-08-01), Shimoda et al.
patent: 4893232 (1990-01-01), Saimaoka et al.
patent: 4901229 (1990-02-01), Tashiro et al.
patent: 4918593 (1990-04-01), Huber
patent: 4930071 (1990-05-01), Tou et al.
patent: 4930072 (1990-05-01), Agrawal et al.
patent: 4933848 (1990-06-01), Haderle et al.
patent: 4947320 (1990-08-01), Crus et al.
patent: 4967341 (1990-10-01), Yamamoto et al.
patent: 5133068 (1992-07-01), Crus et al.
patent: 5168565 (1992-12-01), Morita
patent: 5193183 (1993-03-01), Bachman
patent: 5197005 (1993-03-01), Shwartz et al.
patent: 5226158 (1993-07-01), Horn et al.
patent: 5239663 (1993-08-01), Faudemay
patent: 5247575 (1993-09-01), Sprague et al.
patent: 5262942 (1993-11-01), Earle
patent: 5297279 (1994-03-01), Bannon et al.
patent: 5369761 (1994-11-01), Conley et al.
patent: 5379419 (1995-01-01), Heffernan et al.
patent: 5386557 (1995-01-01), Boykin et al.
patent: 5386559 (1995-01-01), Eisenberg et al.
patent: 5408657 (1995-04-01), Bigelow et al.
patent: 5459860 (1995-10-01), Burnett et al.
patent: 5488722 (1996-01-01), Potok
patent: 5504885 (1996-04-01), Alashqur
patent: 5539870 (1996-07-01), Conrad et al.
patent: 5542073 (1996-07-01), Schiefer et al.
patent: 5548749 (1996-08-01), Kroenke et al.
patent: 5581785 (1996-12-01), Nakamura et al.
patent: 5664177 (1997-09-01), Lowry
patent: 5826259 (1998-10-01), Doktor
patent: 5893108 (1999-04-01), Srinivasan et al.
patent: 6105035 (2000-08-01), Monge et al.
patent: WO 00/07354 (2000-02-01), None
patent: WO 01/15811 (2001-08-01), None
Rudolf Munz, “Design of The Well System”, 1980, Noth-Holland Publishing Company, pp. 505-522.
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.
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.
Munz, R. “Design of the Well System”, in Entity-Relationship Approach to Systems Analysis and Design, Proceedings of the 1st International Conference on the Entity-Relationship Approach, Chen, P. ed., 1979, pp. 502-522.
Malhotra, A. et al. “Implementing an Entity-Relationship Language on a Relational Data Base”, IBM Research Report 12134 (#54499), Aug. 27, 1986.
Rybinski, H. “On First-Order-Logic Databases”, ACM Transactions on Database Systems (TODS), vol. 12, No. 3, Sep. 1987, pp. 325-349.
University of Texas “Data Modeling: the Entity-Relationship Model”, downloaded from www.utexas.edu/its/archive/windows/database/datamodeling/dm/erintro.html, Feb. 29, 2004.
University of Texas “Data Modeling: Primary and Foreign Keys”, downloaded from www.utexas.edu/its/archive/windows/database/datamodeling/dm/keys.html, Feb. 29, 2004.
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-DB-2.pdf, 2007.
Microsoft Corporation, “Relational Database Components”, tutorial, downloaded from msdn.microsoft.com/en-us/library/aa174501(SQL.80).aspx, 2007.
Korth and Silberschatz, Database System Concepts, McGraw-Hill Book Company (New York, 1986),pp. 45-105; pp. 301-323.
“Extended Disjunctive Normal Form for Efficient Processing of Recursive Logic Queries”, IBM Technical Disclosure Bulletin, vol. 30 No. 1, Jun. 1987 pp. 360-366.
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.
Kifer et al, “Sygraf: Implementing Logic Programs in a Database Style” IEEE Transactions on Software Engnrn. v:14, N7, Jul. 1988 pp. 92-935.
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.
Wilschut et al, “Pipelining in Query Execution” Parbase-90 Intl. Conf. on Databases, Parallel Architectures and Their Applications, Mar. 7-9, 1990 p. 562.
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.
Blakely et al., “Experiences Buildig the Open OODB Query Optimizer”, 1993, pp. 287-296.
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.
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.
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.
Blakeley et al., “Experiences Building the Open OODB Query Optimizer”, 1993, pp. 287-296.
Zand et al., “A Survey of Current Object-Oriented Databases”, Data Base Advances, Feb. 1995, vol. 26, No. 1, pp. 14-29.
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.
Kim et al., “Semantics and Implementation of Schema Evolution in Object-Oriented Databases”, 1987, pp. 311-322.
Kim et al., “Composite Object Support in an Object-Oriented Database System”, OOPSLA '87 Proceedings, Oct. 4-8, 1987, pp. 118-125.
Hull et al.,“Semantic Database Modeling: Survey, Applications, and Research Issues”, ACM Computing Surveys, vol. 19, No. 3, Sep. 1987, pp. 201-260.
Nixon et al., “Implementation of a Compiler for a Semantic Data Model: Experiences with Taxis”, 1987, pp. 118-131.
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.
Peckham et al., “Semantic Data Models”, Acm Computi

Affiliated with

Also associated with

Rating

Easily expandable data processing system and method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Easily expandable data processing system and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Easily expandable data processing system and method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3982811