Taxonomy driven multi-system networking and content delivery systems and methods are provided herein. An example systems includes a website authoring platform generating a taxonomy structure for a webpage, the taxonomy structure indicating assets to be included in the webpage a layout for the assets, a technical documentation authoring system for creating technical documents related to the assets, and a metadata binder providing the technical documentation authoring system with access to the taxonomy structure of the website authoring platform so that technical document authors are provided with the taxonomy structure to guide creation and structuring of the technical documents so that the technical documents comprise data that corresponds to the assets.

Taxonomy driven multi-system networking and content delivery systems and methods are provided herein. An example systems includes a website authoring platform generating a taxonomy structure for a webpage, the taxonomy structure indicating assets to be included in the webpage a layout for the assets, a technical documentation authoring system for creating technical documents related to the assets, and a metadata binder providing the technical documentation authoring system with access to the taxonomy structure of the website authoring platform so that technical document authors are provided with the taxonomy structure to guide creation and structuring of the technical documents so that the technical documents comprise data that corresponds to the assets.

Techniques are described herein for leveraging and extending relational data sharding infrastructure to provide comprehensive support for sharding semi-structured and unstructured data, in addition to the relational data, in a single sharded database system. Specifically, techniques are described in which a catalog server pre-gathers all data it needs to answer fetches from a dynamically created temporary lob. In addition, techniques are provided in which a catalog server encodes shard identifiers in lob locators sent to the client. Techniques are provided for pushing down various operators to shard servers.

Techniques are described herein for leveraging and extending relational data sharding infrastructure to provide comprehensive support for sharding semi-structured and unstructured data, in addition to the relational data, in a single sharded database system. Specifically, techniques are described in which a catalog server pre-gathers all data it needs to answer fetches from a dynamically created temporary lob. In addition, techniques are provided in which a catalog server encodes shard identifiers in lob locators sent to the client. Techniques are provided for pushing down various operators to shard servers.

Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions.

Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions.

Case management systems and techniques are disclosed. In various embodiments, for each of a plurality of case nodes comprising a case model a trait definition comprising a corresponding set of traits associated with that case node is received. The respective trait definitions are used to bind each set of traits to the case node with which the set of traits is associated in case instances created based on the case model.

Case management systems and techniques are disclosed. In various embodiments, for each of a plurality of case nodes comprising a case model a trait definition comprising a corresponding set of traits associated with that case node is received. The respective trait definitions are used to bind each set of traits to the case node with which the set of traits is associated in case instances created based on the case model.

Among other things, we describe a method of receiving a portion of metadata from a data source, the portion of metadata describing nodes and edges; generating instances of a data structure representing the portion of metadata, at least one instance of the data structure including an identification value that identifies a corresponding node, one or more property values representing respective properties of the corresponding node, and one or more pointers to respective identification values, each pointer representing an edge associated with a node identified by the corresponding respective identification value; storing the instances of the data structure in random access memory; receiving a query that includes an identification of at least one particular element of data; and using at least one instance of the data structure to cause a display of a computer system to display a representation of lineage of the particular element of data.

Among other things, we describe a method of receiving a portion of metadata from a data source, the portion of metadata describing nodes and edges; generating instances of a data structure representing the portion of metadata, at least one instance of the data structure including an identification value that identifies a corresponding node, one or more property values representing respective properties of the corresponding node, and one or more pointers to respective identification values, each pointer representing an edge associated with a node identified by the corresponding respective identification value; storing the instances of the data structure in random access memory; receiving a query that includes an identification of at least one particular element of data; and using at least one instance of the data structure to cause a display of a computer system to display a representation of lineage of the particular element of data.