Abstract: A method of answering a data request directed to a network of distributed servers includes receiving the data request from a client at a server. The method further includes extracting identifying information of requested data in the data request, using the server. The method further includes obtaining location information of the requested data indicating which of the distributed servers is storing the requested data, by comparing the identifying information to a distributed ledger. The method further includes sending the requested data from the server to the client.

Abstract: A method of answering a data request directed to a network of distributed servers includes receiving the data request from a client at a server. The method further includes extracting identifying information of requested data in the data request, using the server. The method further includes obtaining location information of the requested data indicating which of the distributed servers is storing the requested data, by comparing the identifying information to a distributed ledger. The method further includes sending the requested data from the server to the client.

Abstract: A method of answering a data request directed to a network of distributed servers includes receiving the data request from a client at a server. The method further includes extracting identifying information of requested data in the data request, using the server. The method further includes obtaining location information of the requested data indicating which of the distributed servers is storing the requested data, by comparing the identifying information to a distributed ledger. The method further includes sending the requested data from the server to the client.

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.

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 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: In a cluster where multiple database nodes are synchronized by a distributed lock manager, a process that includes one or more messages that are sent from one or more nodes to a distributed lock manager, wherein one or more of said messages are asynchronous lock taken messages.

Abstract: In a Database Management System (DBMS), an index is used to organize the data such that the data can be efficiently retrieved to satisfy queries. The index may be organized in blocks which are stored in memory or on disk of a computer system. To satisfy a DBMS request, such as an update or query of data, multiple index blocks may need to be retrieved and processed. The claimed subject matter reduces the number of index blocks that needs to be retrieved and processed to satisfy the DBMS requests.

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 that facilitates efficient search and browsing.

Abstract: In a cluster where multiple database nodes are synchronized by a distributed lock manager, a process that includes one or more messages that are sent from one or more nodes to a distributed lock manager, wherein one or more of said messages are asynchronous lock taken messages.

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 that facilitates efficient search and browsing.

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 that facilitates efficient search and browsing.

Abstract: A method of writing data on magnetic stripe of a smart card by imposing a magnetic field of a given polarity on each selected segment of the magnetic stripe, such that data on the magnetic stripe can be read by a magnetic card reader and interpreted as digital bits. The method includes providing a multi-dimensional conductor array placed proximate to the magnetic stripe, the number of conductors in the array is considerably smaller than the number of segments, and each segment is associated with two or more conductors. The method further includes providing current drivers for sending currents in a controlled direction through the conductor array. The system further includes sending currents, using said current drivers, through conductors of the array, such that for each one of the selected segment composite currents flowing through its associated two conductors overcome the coersivity of the segment on the magnetic stripe.

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 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 that facilitates efficient search and browsing.

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 computer program product that includes pointerless binary trie structure. The binary trie structure includes node elements representative of nodes of the trie. The structure further includes control elements that include information that facilitate traversal of the trie in a more efficient manner compared to traversal of pointerless binary trie structure that is devoid of the control elements.

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 that facilitates efficient search and browsing.

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.