Marklogic Corporation

Christopher Lindblad

Paul Pedersen

Mary Holstege

Fayez Saliba

Gajanan Chinchwadkar

Nupoor Kotasthane

Yun Zhang

Haitao Wu

Joe Pasqua

Jane X Chen

A master database module is on a master computer node. Slave database modules are on slave computer nodes connected to the master computer node via a network. A distributed database includes executable code executed by processors on the master computer node and the slave computer nodes to receive a distributed database query at the master computer node. A query execution plan is prepared at the master computer node. The query execution plan is deployed on the slave computer nodes. The query execution plan is executed on the slave computer nodes. The slave computer nodes each perform a single node query execution analysis to selectively produce a query cancellation command. The query cancellation command is propagated to the master computer node and the slave computer nodes. The query execution plan is cancelled on the master computer node and the slave computer nodes.

Apparatus and method for distributed database query cancellation based upon single node query execution analysis

A non-transitory computer readable storage medium has instructions executed by a processor to receive a debug adapter request. A HyperText Transfer Protocol (HTTP) request is generated from the debug adapter request. A debug request is derived from the HTTP request. Privilege to submit the debug request is confirmed. A string serialized JavaScript Object Notation (JSON) debug request is submitted to a JavaScript Engine. A string serialized JSON debug response from the JavaScript Engine is received. A JSON debug response is formed from the string serialized JSON debug response. An HTTP response is prepared from the JSON debug response. A debug adapter response based upon the HTTP response is submitted.

Debug adapter to facilitate server-side javascript debugging

An apparatus has a processor and a memory connected to the processor. The memory stores instructions executed by the processor to ingest and store a semi-structured document within a database. A template is suggested based upon an evaluation of the semi-structured document. The template includes a context specification of a template path that corresponds to a path within the semi-structured document. The template further includes an index specification characterizing data to be extracted from the semi-structured document. A template selection is received. The template selection is executed to form an index entry for the semi-structured document within an index.

Apparatus and method for template driven data extraction in a semi-structured document database

An apparatus has a processor and a memory connected to the processor. The memory stores instructions executed by the processor to traverse paths of a document with semi-structured data. For each path that is unprotected, a term at a terminating node of the path is added to an index as a query term. For each path that is protected, a term at a terminating node of the path is combined with a permission to form a combined query term that is added to the index.

Apparatus and method for supplying path protected search results from a semi-structured document database

A non-transitory computer readable storage medium includes executable instructions to receive primary matched values with corresponding document identifications. The primary matched values correspond to a specified primary value, for example expressed in a search query. A secondary scalar index is scanned to match the document identifications with secondary matched values with corresponding secondary values. A tertiary scalar index is scanned to match the document identifications with tertiary matched values with corresponding tertiary values. The secondary values and tertiary values are provided as tuples. Each tuple has the specified primary value, a secondary value, a tertiary value and frequency indicia.

Apparatus and method for computing n-way co-occurrences of data tuples in scalar indexes

A method of operating a tree structured database includes receiving a document, forming a top-down tree characterizing the document, generating pre-computed indices characterizing the document, combining subsets of the pre-computed indices to dynamically create a table of information characterizing the document, and resolving a structured query language query against the table to form collected data.

Apparatus and method for executing different query language queries on tree structured data using pre-computed indices of selective document paths

A method of processing a query in a distributed database implemented across a set of nodes includes receiving a query. The query is divided into split characterization queries. The split characterization queries are distributed to worker nodes. Each worker node stores a partition of the distributed database with encoded textual objects and pre-defined indices characterizing encoded textual object fragments. The split characterization queries are executed at the worker nodes to obtain preliminary information about query results. Executing the split characterization queries includes matching query fragments associated with the split characterization queries with encoded textual object fragments of the pre-defined indices to produce fragment matches representative of the size of the query results. For each split characterization query the preliminary information about query results includes a fragment count, a database partition identification, and a database host name.

Apparatus and method for securing preliminary information about database fragments for utilization in mapreduce processing

A method for processing queries for a document of elements is provided. The document includes a plurality of subsections where each subsection includes at least a portion of elements in the document. The method comprises: receiving a query for a path of elements in the document of elements; determining a plurality of step queries from the query, each step query including at least a part of the path of elements; for each step query in the plurality of step queries, determining one or more subsections that include elements that correspond to a step query; and determining at least one subsection that includes the path of elements of the query. A result for the query is generated using the at least one subsection.

Parent-child query indexing for XML databases

Parent-child query indexing for xml databases

A method for processing queries for a document of elements is provided. The document includes a plurality of subsections where each subsection includes at least a portion of elements in the document. The method comprises: receiving a query for a npath of elements in the document of elements; determining a plurality of step queries from the query, each step query including at least a part of the path of elements; for each step query in the plurality of step queries, determining one or more subsections that include elements that correspond to a step query; and determining at least one subsection that includes the path of elements of the query. A result for the query is generated using the at least one subsection.

One aspect of the present invention is a system for classifying element nodes in a subtree-structured XML database. The XQE structural-textual classification system is sensitive to both the textual resemblance between document elements as well as the structural resemblance between document elements. The XQE structural-textual classification system might use the XQE parent-child index described in Lindblad II-A for the purpose of forming vectors of 'terms' which encode both the structural and the textual content of XML elements. The element vectors are processed by a classifier to create class prototype vectors which can be used to classify elements as they are added to the database.

Growing community of inventors

Berkeley, CA, United States of America

Christopher Lindblad