Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-09-05
2006-09-05
Gaffin, Jeffrey (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C715S700000, C709S223000
Reexamination Certificate
active
07103613
ABSTRACT:
An object oriented query such as an enterprise java bean query is translated into a corresponding relational query by identifying an inter-hierarchal relationship relating two or more object oriented hierarchies; identifying a source object oriented hierarchy of the inter-hierarchal relationship; mapping the source object oriented hierarchy into corresponding source relational tables; building a source series of joins between the source relational tables, the source series being ordered in a top-down order from a root of the source object oriented hierarchy; identifying a target class of the inter-hierarchal relationship; mapping the target object oriented hierarchy into corresponding target relational tables; building a target series of joins between the target relational tables, the target series comprising a first target series and a second target series, the first target series corresponding to the target class, a root of the target object oriented hierarchy, and intervening nodes between the target class and the root of the target object oriented hierarchy, and the second target series corresponding to nodes in leaves of the target object oriented hierarchy located below the target class; and combining the source series of joins and the target series of joins into the corresponding relational query. For a query selection based upon a plurality of relationships between the object oriented hierarchies, the steps may be repeated for each of the plurality of relationships. The combined series of joins may be further reordered by recursively finding a join relationship between a current node and a preceding node in the combined series of joins. To improve performance, a join above a target of a relationship is built as an inner join, and a join below the target of relationship is built as an outer join.
REFERENCES:
patent: 5504885 (1996-04-01), Alashqur
patent: 5694598 (1997-12-01), Durand et al.
patent: 5765159 (1998-06-01), Srinivasan
patent: 5774692 (1998-06-01), Boyer et al.
patent: 5797136 (1998-08-01), Boyer et al.
patent: 5829006 (1998-10-01), Parvathaneny et al.
patent: 5878427 (1999-03-01), Waheed et al.
patent: 5878431 (1999-03-01), Potterveld et al.
patent: 5937409 (1999-08-01), Wetherbee
patent: 5970490 (1999-10-01), Morgenstern
patent: 6047284 (2000-04-01), Owens et al.
patent: 6105035 (2000-08-01), Monge et al.
patent: 2004/0015487 (2004-01-01), Lin et al.
patent: 2005/0065927 (2005-03-01), Nouri et al.
patent: 2005/0125432 (2005-06-01), Lin et al.
Gustav Fahl, Tore Risch, “Query processing over object views of relational data.” 1997. The VLDB Journal. vol. 6, pp. 261-281.
IBM VisualAge® for Java, Version 3.5, EJB Development Environment, International Business Machines Corporation 1998, 2000, pp. 1-173.
IBM VisualAge® for Java, Version 3.5, Building applications with persistence support, International Business Machines Corporation 1997, 2000, pp. 1-159.
Gaffin Jeffrey
International Business Machines - Corporation
Konrad Raynes & Victor LLP
Radtke Mark Andrew X
Victor David W.
LandOfFree
Object oriented query root leaf inheritance to relational... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Object oriented query root leaf inheritance to relational..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Object oriented query root leaf inheritance to relational... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3607758