Abstract:
A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way facilitates efficient search and browsing.
Abstract:
A system for managing a cluster of databases that process shared data, the system including a cluster of database nodes, each node including a memory, and a processor configured to, when it is determined that: (i) a lock on a resource is required by a particular node or process, and (ii) no other lock conflicts with this particular lock, send an asynchronous lock taken (ALT) message to a distributed lock manager (DLM); and without receiving a response or permission from the DLM, taking the lock for a resource for the particular node or process.
Abstract:
A system for managing a cluster of databases that process shared data, the system including a cluster of database nodes, each node including a memory, and a processor configured to, when it is determined that: (i) a lock on a resource is required by a particular node or process, and (ii) no other lock conflicts with this particular lock, send an asynchronous lock taken (ALT) message to a distributed lock manager (DLM); and without receiving a response or permission from the DLM, taking the lock for a resource for the particular node or process.
Abstract:
A system including a shared disk database cluster with multiple database nodes, the nodes configured to perform multiple processes, each database node configured to: insert data to a table, assign a unique location for the insert, the location representing a primary key and update the table without requiring contention between different processes.
Abstract:
A method for encoding hierarchical data stored in an index, partitioned into blocks, over keys representing the data. For every key K representing a record R in the index, the key of the children records of record R are prefixed with K. The method includes traversing to a first R record represented in the index, traversing from the record R to the next sequential R such that the path in the index from the position representing R to the position representing the next sequential R does not include information relating to the children of R. Next, repeating the latter operation for 0 or more R records, and for any 0 or more particular R records, traversing from the particular R to its children. The index constitutes a balanced structure of blocks.
Abstract:
A system including a shared disk database cluster including one or more database nodes, and at least two storage nodes including a first storage node or nodes with data organized in a row-based format, and a second storage node or nodes with data organized in a column-based format. A method for efficiently searching utilizing a shared disk database cluster including one or more database nodes, and at least two storage nodes including a first storage node or nodes with data organized in a row-based format, and a second storage node or nodes with data organized in a column-based format.