Abstract: Techniques for partitioning nested tables are provided. A parent table includes a column for collection items. A nested table is created for storing items that belong to the collection items. The nested table is partitioned to create a plurality of nested table partitions. Each nested table partition is a distinct, separately stored structure within a database. How the nested table is partitioned may, or may not, be based on how the parent table is partitioned. For example, a nested table may be partitioned based on the same criteria in which the parent table is partitioned. As another example, a nested table may be partitioned, whereas the parent table is not partitioned.

Abstract: A data access engine and graphic interface for portable computer devices are disclosed. According to one embodiment a system comprises a server in communication with a network, a database in communication with the network, a device in communication with the network, and an interface displayed on the device. The interface has a nested ring structure, wherein the nested ring structure comprises a contiguous geometrical shape, and a labeled segment having a category. The contiguous geometrical shape and labeled segment are hierarchically structured.

Abstract: A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also described.

Abstract: The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Nodes in a KStore are typically comprised of at least four fields, including a pointer to an asCase node, a pointer to an asResult node, a pointer to an asCaseList and a pointer to an asResultList. Because either an asCaseList or an asResultList but not both will exist in any particular node, two new node types are created, one node comprising a node with an asCase pointer, an asResult pointer and asCaseList pointer but not including a pointer to an asResultList and one node with a pointer to an asCase node, and asResult node and an asResultList but not including a pointer to an asCaseList. Alternatively, a single node structure may exist with a pointer to a list in one field and an indicator stored in another field that indicates directly or indirectly whether the list pointed to is an asCaseList or an asResultList.

Abstract: The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. A KStore event manager monitors events and polls for KStore state. When triggered by user-defined conditions or receiving notification that a specified event has occurred, a specified response can be executed. An event/condition/response is defined through a KStore event wizard. When a triggering condition is detected or a notification of an event is received, a user-defined action or sequence of actions is performed automatically, without further user interaction.

Abstract: The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Values of elemental root nodes within a KStore can be changed without requiring the KStore to be rebuilt. The elemental root node whose value is to be altered is identified, and the new value is inserted directly into the node or in the area identified by the pointer to the node value within the node. Values can include those needed to recognize user data and/or values for elemental root nodes used internally within the KStore structure. Values of the elemental root nodes can be updated after the instantiation of the KStore and the population of the KStore.

Abstract: The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore.

Abstract: A method and structure for storing information for one or more semantic objects derived from raw data. A semantic object extracted from the raw data and classified to comprise the semantic object is received, the received semantic object having one or more attributes. A summary of attributes of the semantic object by calculating one or more statistics of one or more of the one or more attributes of the received semantic object, a confidence level of the received semantic object that quantifies a degree of certainty that the received semantic object has been correctly classified and/or labeled; and a compact representation of raw data of the received semantic object are generated. Indexing information for one or more of the summary of attributes and the compact representation of the semantic object is generated.

Abstract: Values for virtual recursive attributes are generated for distinguished name entries in a lightweight directory access protocol directory by navigating through the directory tree starting at the distinguished name entry specified by an input value. An attribute list of the values for the virtual recursive attributes may be cached or indexed. In another aspect, attribute lists are generated for all branches of the directory tree.

Abstract: A compiler, which makes a computer carry out a process for generating a program used for a remote access to a virtual database comprising a first computer 11 including an application program and a second computer 12 being connected to the first computer 11 by way of a network and including one or more databases, replaces (1c) a description part relating to a DML execution process for the virtual database from a source code 7 of the application program with a description relating to an RPC process and generates a program for executing the DML execution process for the native databases based on the RPC process. The use of the program enables a high performance remote database access while applying a virtual database function aiming at facilitating a business logic buildup.

Abstract: There is a provided a method for providing contents referencing information (CRI) for personal data broadcasting service, including the steps of: searching a program identifier (PID) having a CRI section, and searching a container having a specific identifier; extracting container data from the searched container; searching a CRI structure which indicates a contents referencing information identifier (CRID) list from the extracted container data; searching and extracting CRID data based on a CRID data container which represents an identifier of the container having the CRID data in the CRID list of the searched CRI structure; and searching and extracting result data for the extracted CRID from a result locator.