`
`USOORE405 20F]
`
`(12) EX PARTE REEXAMINATION CERTIFICATE (7285th)
`United States Patent
`Doktor
`
`US RE40,520 F1
`(10) Number:
`
`(45) Certificate Issued: Jan. 5, 2010
`
`(54) EASILY EXPANDABLE DATA PROCESSING
`SYSTEM AND METHOD
`
`OTHER PUBLICATIONS
`
`(75)
`
`Inventor: Karol Doktor. Wheelers Hill (AU)
`
`(73) Assignee: Financial SystemsTechnology,
`Malvem, Victoria (AU)
`
`Reexamination Request:
`No. 90/008648. Jun. 11. 2007
`
`Reexamination Certificate for:
`Patent No.:
`Re. 40,520
`Issued:
`Sep. 23, 2008
`Appl. No.:
`11/152,835
`Filed:
`Jun. 14, 2005
`
`Related US. Patent Documents
`
`Reissue of:
`(64) Patent No.:
`Issued:
`Appl. No.:
`Filed:
`
`Re. 40,520
`Sep. 23, 2008
`08/862,176
`May 22, 1997
`
`Related US. Application Data
`
`(63) Continuation of application No. 08/439,207. filed on May
`11. 1995. now Pat. No. 5.675.779. which is a division of
`application No. 08/083861. filed on Jun. 28. 1993. now Pat.
`No. 5.604.899. which is a continuation of application No.
`07/526,424. filed on May 21. 1990. now abandoned.
`
`(51)
`
`Int. Cl.
`G06F 17/30
`
`(2006.01)
`
`................................................ 707/4; 707/2
`(52) US. Cl.
`(58) Field of Classification Search ........................ None
`See application file for complete search history.
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`4.506.326 A
`4.774.661 A
`4.918.593 A
`
`3/1985 Shaw eta].
`9/1988 Kumpati
`4/1990 Huber
`
`Toby .l. Teorey. et al., “A Logical Design Methodology for
`Relational Databases Using the Extended Entity—Relation-
`ship Model”, Computing Surveys. vol.
`18. No. 2. pp.
`197—222 (Jun. 1986).
`Daniel R. Dolk, et al., “A Relational Information Resource
`Dictionary System”. Computing Practices, Communications
`of the ACM. vol. 30, No.
`1 (Jan. 1987).
`M. M. Zloof. “Query—by—Example: a data base language”.
`IBM Systems Journal. No.4. pp. 324—343 (1977).
`D. Tsichritzis, “LSL: A Link and Selector Language", Pro-
`ceedings of the 1976 ACM SIGMOD International Confer—
`ence on Management of Data. Washington. DC, (Jun. 2—4.
`1976).
`Rudolph Munz. “The Well System: A Multi—User Database
`System Based on Bunary Relationships and Graph—Pattem—
`Matching", 3 Information Systems. pp. 99—115, Pergamon
`Press (I978).
`Peter Pin—Shan Chen. “The entity—relationship model—A
`basis for the enterprise view of data” 77 (1977).
`Mark L. Gillenson. “Database Step—by—Step", pp. 141—142.
`2d Ed. (1990).
`
`Primary Eraminer—Alexander] Kosowski
`
`(57)
`
`ABSTRACT
`
`Machine automated techniques are described for a method
`of data processing called Relationships Processing. A com-
`puting 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 rela-
`tionships 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
`user 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.
`
`
`
`PLOT-QBEEEl—ol
`«azaaa !l;”'-El!
`@3ij :1 lI“
`
` IBM EX. 1027
`
`
`
`1
`
`EX PARTE
`
`REEXAMINATION CERTIFICATE
`ISSUED UNDER 35 U.S.C. 307
`
`NO AMENDMENTS HAVE BEEN MADE TO
`THE PATENT
`
`US RE40,520 F1
`
`2
`
`AS A RESULT OF REEXAMINA’HON. IT HAS BEEN
`
`DETERMINED THAT:
`
`The patentability of claims 1—18 is confirmed.
`
`*
`
`*
`
`*
`
`*
`
`*
`
`