Posted: January 27, 2014 Filed under: 1.2 Support of OOP Directly in a RDBMS | Tags: Chris Date, Divine Inspirations, graph theory, Larry Ellison, Marten Mickos, MySQL, Nancy Li, object oriented programming, OOP, Oracle, Rich McGinn, soft schema, transitive closure Leave a comment
Presentation Overview: This presentation describes how to support object oriented programming (OOP) directly in a relational database. This includes support for the notion of classes, objects, single/multiple inheritance, polymorphism, etc… all using standard SQL. Support of OOP is achieved by treating OOP as a graph problem, utilizing 3 tables to represent class information and 3 tables to represent object information. Collectively, these 6 tables comprise the notion of a soft schema.
Slide Presentation: Support of OOP Directly in a RDBMS
Demonstration: Instantiation of a TCSQL Class
Posted: January 25, 2014 Filed under: 1.3 Graph Queries in a RDBMS | Tags: Divine Inspirations, EHR systems, graph queries, graph theory, inference query, multi-dimensional relationship query, NLP, ontology, path query, polymorphic query, RDBMS, SNOMED, subsumption, TCSQL, transitive closure Leave a comment
Presentation Overview: This presentation describes a variety of graph queries in a relational database. Query types include subsumption, path, inference, and polymorphism. These query types are based upon the use of transitive closure.
Slide Presentation: Graph Queries in a RDBMS
Demonstration: Path Query
Demonstration: Querying Cyclic Graphs
Demonstration: Related Concepts Query
Demonstration: Multidimensional Relationship Query
Posted: January 21, 2014 Filed under: 4.2 Soft Star Schema Data Warehouse | Tags: business enterprise system, data, data warehouse, Divine Inspirations, ETL, graph theory, information, knowledge, ontological star schema data warehouse, ontology, pivoted ontological star schema data warehouse, soft star schema, sql, TCSQL, xml Leave a comment
Presentation Overview: This presentation describes the notion of a soft star schema data warehouse and a general ETL method applicable to any structured data. Having a soft star schema data warehouse enables the ability to write domain-independent queries.
Slide Presentation: Soft Star Schema Data Warehouse
Prerequisite Video Presentation: Support of OOP Directly in a RDBMS
Prerequisite Video Presentation: Processing XML in a RDBMS
Demonstration: Transforming an Information System into a Knowledge System
Posted: January 19, 2014 Filed under: 4.3 Categorizing Structured Data | Tags: CDA, Clinical Trial, data, Divine Inspirations, graph theory, Hierarchy, HL7, information, knowledge, NLP, NQF Quality Measure, ontology, SNOMED, TCSQL, UMLS, vocabulary, xml Leave a comment
Presentation Overview: This presentation describes ways of categorizing structured data. The ability to categorize structured data is the key to enable writing powerful queries that cross domain boundaries. Many of the categorization examples are in the healthcare field.
Slide Presentation: Categorizing Structured Data
Prerequisite Video Presentation: Support of OOP Directly in a RDBMS
Prerequisite Video Presentation: Processing XML in a RDBMS
Demonstration: Importing XML into TCSQL
Demonstration: Importing XSD into TCSQL
Demonstration: Instantiation of an XSD Class
Demonstration: Natural Language Processing
Demonstration: Social Network
Posted: January 11, 2014 Filed under: 2.3 Connection-Taxonomy-Based Transitive Closure Maintenance | Tags: Divine Inspirations, graph theory, taxonomy, TCSQL, transitive closure Leave a comment
Presentation Overview: This presentation descibes how to maintain multiple transitive closures in a taxonomy of connections. Transitive closure maintenance is driven by connection types. This advanced TCSQL features enables the use of more generalized superclass connections when writing queries.
Slide Presentation: Connection-Taxonomy-Based Transitive Closure Maintenance
Prerequisite Video Presentation: Graph Navigation in a RDBMS
Prerequisite Video Presentation: Support of OOP Directly in a RDBMS
Posted: January 9, 2014 Filed under: 2.4 Temporal-Based Transitive Closure Maintenance | Tags: Divine Inspirations, graph theory, graph versioning, TCSQL, transitive closure Leave a comment
Presentation Overview: This presentation describes how to maintain transitive closure temporally. This advanced TCSQL feature enables the transitive closure maintenance over time. As nodes and connections are added and deleted in a graph, the transitive of all changes is remembered, enabling the ability to ask how a graph looked in the past.
Slide Presentation: Temporal-Based Transitive Closure Maintenance
Prerequisite Video Presentation: Graph Navigation in a RDBMS
Prerequisite Video Presentation: Support of OOP Directly in a RDBMS
Divine Inspirations LLC 