Ori Software Development Ltd.

Other

Moshe Shadmon

Neal J Sample

Michael J Franklin

Brian Cooper

Josef Osterweil

Daniel Abadi

Levy Cohen

Owen Arden

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.

System and apparatus to manage data using a peer-to-peer network and the blockchain

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.

Efficient distributed lock manager

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.

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.

Encoding semi-structured data for efficient search and browsing

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.

Method and system for data writing/reading onto/from and emulating a magnetic stripe

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.

Efficient traversals over hierarchical data and indexing semistructured data

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.

A method for obtaining a balanced digital tree structure. The digital tree structure including a first vertical oriented digital tree structure that is susceptible to unbalanced structure of blocks due to modify transactions. The first digital tree including blocks, each, accommodating a plurality of nodes and links originating from the nodes. The method includes the step of constructing few vertical oriented digital tree structure levels. The tress are arranged such that from blocks of a tree in a given level, it is possible to access horizontally all the blocks of the next level, according to a common key value of the accessed block, whereby a balanced horizontal oriented digital tree structure is obtained.

Growing community of inventors

Palo Alto, CA, United States of America

Moshe Shadmon