Abstract: A configurable assistive device comprising: a platform; at least three wheels; and, at least three independent leg mechanisms, each respective leg mechanism coupled to the platform and a respective one of the at least three wheels, each respective leg mechanism configured to move the platform relative to the respective wheel for positioning the platform at an elevation and for inclining the platform to an inclination to configure the assistive device into one of a plurality of configurations.

Abstract: A configurable assistive device comprising: a platform; at least three wheels; and, at least three independent leg mechanisms, each respective leg mechanism coupled to the platform and a respective one of the at least three wheels, each respective leg mechanism configured to move the platform relative to the respective wheel for positioning the platform at an elevation and for inclining the platform to an inclination to configure the assistive device into one of a plurality of configurations.

Abstract: Representing an XML Schema Definition and Data within a Relational Database Management System using a Reusable Custom-Defined Nestable Compound Data Type. These Data Types provide a natural representation and storage of an XML schema definition and the corresponding XML data. Data Types are created in a RDBMS to store the hierarchical data of a XML data file. Hierarchical data may be imported into a RDBMS by populating the Data Type Fields with the values of data held in the XML data file. The data contained in the RDBMS may also be published to an XML data file.

Abstract: A method for generating and using a reusable custom-defined nestable compound data type for use as a database qualifier provides significant advantages over using traditional non-reusable structured tables of RDBM systems is described. The method and data structures of the invention may be used to define and instantiate flexible nested-record structures that reverse and better expose the relationship between parent records and private child sub-records in a database schema to provide improved referential integrity and visibility into database structure.

Abstract: An object matching system comprises a plurality of disparate databases comprising data objects and a master data server. The master data server comprises a computer programmed to provide a plurality of adapters configured to connect to said plurality of disparate databases, a matching module configured to compare data objects provided by said plurality of adapters through use of an object matching rule to determine at least two matching data objects, and a data integrator configured to merge said at least two matching data objects to produce a master data object.

Abstract: The reusable custom-defined nestable compound data type for construction of database objects of one or more embodiments of the invention provide advantages over traditional non-reusable structured tables of RDBM systems. The data structure of one or more embodiments of the invention may be thought of in part as a generalized form of a user defined compound data type that may be used to model various “exotic” data structures, such as flexible hierarchies and networks, in database schema. Thus, the system, methods and data structures of one or more embodiments of the invention may be used to define and instantiate structures that support the creation of flexible nested records that expose the relationship between parent records and private child sub-records in a database schema.

Abstract: Embodiments of the invention provide an accelerated system and methods for gathering business information, augmenting that information to conform to requirements for sharing the information and for synchronizing, managing and publishing the information across the supply chain. Through use of a control module business information is gathered from a variety of enterprise wide systems and stored via an acceleration engine. After augmenting and/or altering the information to conform to the requirements of a desired repository of information known as a data pool, the information is published to the data pool and registered by the data pool with a registry for looking up the published information. One or more embodiments of the invention allow for the rapid publication and modification of publication related data using advanced querying mechanisms of the acceleration engine.

Abstract: A method for creating a self-configuring database system using a reusable custom-defined nestable compound data type of the invention provides significant advantages over using traditional non-reusable structured tables of RDBM systems. A data structure concept and associated method support creating a self-configuring database system programmatically responsive to importing data using schema descriptions in multiple formats. Thus, the method and data structures of the invention may be used to define and instantiate flexible nested record structures that reverses and better exposes the relationship between parent records and private child sub-records in a database schema.

Abstract: Representing an XML Schema Definition and Data within a Relational Database Management System using a Reusable Custom-Defined Nestable Compound Data Type. These Data Types provide a natural representation and storage of an XML schema definition and the corresponding XML data. Data Types are created in a RDBMS to store the hierarchical data of a XML data file. Hierarchical data may be imported into a RDBMS by populating the Data Type Fields with the values of data held in the XML data file. The data contained in the RDBMS may also be published to an XML data file.

Abstract: The reusable custom-defined nestable compound data type for construction of database objects of one or more embodiments of the invention provide advantages over traditional non-reusable structured tables of RDBM systems. The data structure of one or more embodiments of the invention may be thought of in part as a generalized form of a user defined compound data type that may be used to model various “exotic” data structures, such as flexible hierarchies and networks, in database schema. Thus, the system, methods and data structures of one or more embodiments of the invention may be used to define and instantiate structures that support the creation of flexible nested records that expose the relationship between parent records and private child sub-records in a database schema.

Abstract: An embodiment of the invention comprises a method and apparatus for structuring, storing and retrieving data in database systems utilizing relational objects referred to as qualifiers. Catalog data are segregated into one or more primary tables (e.g., main tables), one or more lookup tables, and one or more qualified lookup tables following a predefined set of categories and a taxonomy. Qualified lookup tables comprise a special type of fields referred to as qualifiers. Searches are conducted in embodiments of the invention by determining a set of lookup fields, performing a lookup in one or more lookup tables, and retrieving data values which include association values with records that belong to one or more primary tables. The qualifiers are then used to narrow the search space by selecting only those values that satisfy the selection criteria with regard to the qualifiers. In embodiments of the invention, only a small set in the primary table are traversed to retrieve eligible records.

Abstract: An object matching system comprises a plurality of disparate databases comprising data objects and a master data server. The master data server comprises a computer programmed to provide a plurality of adapters configured to connect to said plurality of disparate databases, a matching module configured to compare data objects provided by said plurality of adapters through use of an object matching rule to determine at least two matching data objects, and a data integrator configured to merge said at least two matching data objects to produce a master data object.

Abstract: A method for generating and using a reusable custom-defined nestable compound data type for use as a database qualifier provides significant advantages over using traditional non-reusable structured tables of RDBM systems is described. The method and data structures of the invention may be used to define and instantiate flexible nested-record structures that reverse and better expose the relationship between parent records and private child sub-records in a database schema to provide improved referential integrity and visibility into database structure.

Abstract: An embodiment of the invention comprises a method and apparatus for structuring, storing and retrieving data in database systems utilizing relational objects referred to as qualifiers. Catalog data are segregated into one or more primary tables (e.g., main tables), one or more lookup tables, and one or more qualified lookup tables following a predefined set of categories and a taxonomy. Qualified lookup tables comprise a special type of fields referred to as qualifiers. Searches are conducted in embodiments of the invention by determining a set of lookup fields, performing a lookup in one or more lookup tables, and retrieving data values which include association values with records that belong to one or more primary tables. The qualifiers are then used to narrow the search space by selecting only those values that satisfy the selection criteria with regard to the qualifiers. In embodiments of the invention, only a small set in the primary table are traversed to retrieve eligible records.

Abstract: An embodiment of the invention comprises a method and apparatus for structuring, storing and retrieving data in database systems utilizing relational objects referred to as qualifiers. Catalog data are segregated into one or more primary tables (e.g., main tables), one or more lookup tables, and one or more qualified lookup tables following a predefined set of categories and a taxonomy. Qualified lookup tables comprise a special type of fields referred to as qualifiers. Searches are conducted in embodiments of the invention by determining a set of lookup fields, performing a lookup in one or more lookup tables, and retrieving data values which include association values with records that belong to one or more primary tables. The qualifiers are then used to narrow the search space by selecting only those values that satisfy the selection criteria with regard to the qualifiers. In embodiments of the invention, only a small set in the primary table are traversed to retrieve eligible records.

Abstract: An embodiment of the invention comprises a method and apparatus for structuring, storing and retrieving data in database systems utilizing relational objects referred to as qualifiers. Catalog data are segregated into one or more primary tables (e.g., main tables), one or more lookup tables, and one or more qualified lookup tables following a predefined set of categories and a taxonomy. Qualified lookup tables comprise a special type of fields referred to as qualifiers. Searches are conducted in embodiments of the invention by determining a set of lookup fields, performing a lookup in one or more lookup tables, and retrieving data values which include association values with records that belong to one or more primary tables. The qualifiers are then used to narrow the search space by selecting only those values that satisfy the selection criteria with regard to the qualifiers. In embodiments of the invention, only a small set in the primary table are traversed to retrieve eligible records.