US2005278308A1PendingUtilityA1

Methods and systems for data integration

Individually held — no corporate assignee on recordPriority: Jun 1, 2004Filed: Jun 1, 2004Published: Dec 15, 2005
Est. expiryJun 1, 2024(expired)· nominal 20-yr term from priority
G06F 16/2246G06F 16/27G06F 16/93G06F 16/25
28
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A preferred method embodiment of the subject invention comprises a method for dynamically creating hierarchies to be used in database searches, comprising the steps of: (a) defining a data network; (b) receiving a query regarding data stored in one or more databases; and (c) based at least in part on said query and on said data network, dynamically building a hierarchy. A preferred system embodiment of the subject invention comprises a system for dynamically creating hierarchies to be used in database searches, comprising: (a) means for defining a data network; (b) means for receiving a query regarding data stored in one or more databases; and (c) means for, based at least in part on said query, dynamically building a hierarchy from said data network.

Claims

exact text as granted — not AI-modified
1 . A method for dynamically creating hierarchies to be used in database searches, comprising the steps of: 
 defining a data network;    receiving a query regarding data stored in one or more databases; and    based at least in part on said query and on said data network, dynamically building a hierarchy.    
     
     
         2 . A method as in  claim 1 , wherein said data network comprises nodes and connectors.  
     
     
         3 . A method as in  claim 2 , wherein said step of defining a data network comprises linking one or more source nodes to one or more linked nodes via connectors.  
     
     
         4 . A method as in  claim 3 , wherein said connectors comprise output field elements and define relationships between said nodes.  
     
     
         5 . A method as in  claim 4 , wherein said hierarchy is built based on said output fields and said relationships.  
     
     
         6 . A method as in  claim 2 , further comprising identifying a root connector in said data network based on said query.  
     
     
         7 . A method as in  claim 1 , wherein said data network is defined based on a relational data model.  
     
     
         8 . A method as in  claim 1 , wherein said step of defining a data network comprises analyzing a data model to identify objects to be exposed.  
     
     
         9 . A method as in  claim 8 , wherein said step of defining a data network further comprises analyzing an inheritance tree of said identified objects.  
     
     
         10 . A method as in  claim 9 , wherein said step of defining a data network further comprises analyzing relationships between said objects.  
     
     
         11 . A method as in  claim 10 , wherein said relationships between said objects comprise multiplicity relationships and reciprocal relationships.  
     
     
         12 . A method as in  claim 10 , wherein said step of defining a data network further comprises defining connectors for each of said objects.  
     
     
         13 . A method as in  claim 12 , wherein said step of defining connectors for each of said objects results in exposing relevant data in a hierarchy appropriate for the object.  
     
     
         14 . A method as in  claim 12 , wherein said connectors form subnetworks.  
     
     
         15 . A method as in  claim 14 , wherein, for each subnetwork, the connectors therein are modified to reflect relationships between objects in said network.  
     
     
         16 . A method as in  claim 12 , wherein said connectors comprise connectors that transform data.  
     
     
         17 . A method as in  claim 12 , wherein said connectors comprise connectors that integrate data from external sources.  
     
     
         18 . A method of querying a data network, comprising the steps of: 
 selecting desired fields;    specifying a root;    specifying a search condition; and    specifying a path to each of one or more of said desired fields.    
     
     
         19 . The method of  claim 18 , wherein said step of specifying a root comprises specifying a FROM clause.  
     
     
         20 . The method of  claim 18 , wherein each path corresponds to a set of connectors.  
     
     
         21 . The method of  claim 20 , wherein said set of connectors comprises one or more of the following: one to many connector, one to one connector, pivot connector.  
     
     
         22 . A system for dynamically creating hierarchies to be used in database searches, comprising: 
 means for defining a data network;    means for receiving a query regarding data stored in one or more databases; and    means for, based at least in part on said query, dynamically building a hierarchy from said data network.    
     
     
         23 . A system for querying a data network, comprising: 
 means for selecting desired fields;    means for specifying a root; and    means for specifying a search condition.    
     
     
         24 . A system for querying databases, comprising: 
 an electronic query server, wherein said query server is operable to receive electronic communications from and transmit electronic communications to a user terminal via an electronic communication network; and    one or more database servers, each of which is in electronic communication with said query server, wherein each database server is operable to search one or more databases;    wherein said query server is operable to receive an electronic query over said electronic communication network from said user terminal and, based on said query, dynamically create one or more hierarchies.    
     
     
         25 . A system as in  claim 24 , wherein said one or more hierarchies are created based on data networks.  
     
     
         26 . A system as in  claim 25 , wherein said data networks comprise nodes connected by connectors, and wherein each node corresponds to a set of data.

Join the waitlist — get patent alerts

Track US2005278308A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.