Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A non-transitory computer readable medium storing computer executable instructions for execution by a computing system, the stored instructions being executable to cause the computing system to at least: execute a database indexing process on a plurality of text documents where each entry in the database index comprises: a key comprising a subset of words occurring in at least one hierarchical node of at least one of the plurality of documents and a data value associated with the respective hierarchical node, wherein the subset of words is separated into multiple elements within the key that comprise at least one word in the subset of words and a remainder of the subset of words; and a value comprising one or more references to the text documents in which the subset of words of the respective entry occurs, wherein the at least one word in the subset of words is the first element in the key.
A database indexing system uses a non-transitory computer-readable medium. It executes a database indexing process on text documents containing hierarchical nodes (e.g., XML). The index comprises entries with a key-value pair. The key includes a subset of words from a hierarchical node and a data value representing that node. The word subset is split into multiple elements, the first being at least one word and the remainder being the rest of the subset. The value references the document where the word subset occurs, with the key's first element containing at least one word from the subset.
2. The computer readable medium of claim 1 , wherein the at least one word in the subset of words is a first word and the key is structured in the following order: the first word of the subset of words, the data value associated with the respective hierarchical node, and the remainder of words of the subset of words, the remainder including at least one word.
In the database indexing system from the previous description, the key is structured with the first word of the word subset first, then the hierarchical node's data value (e.g., the node name), and lastly, the remaining words of the word subset. This remainder must include at least one word. The key structure is: [first word, node data value, remaining words].
3. The computer readable medium of claim 1 , wherein the entries are sorted by a first word of the subset of words in a first alphabetical order, by the data value associated with the respective hierarchical node in a document order, and/or by the remainder of words of the subset of words in a second alphabetical order.
In the database indexing system from the initial description, the index entries are sorted. Sorting occurs first by the first word of the subset in alphabetical order. Then, within the same first word, entries are sorted by the data value associated with the hierarchical node in document order. Finally, entries with the same first word and node value are sorted by the remainder of the words in the subset in alphabetical order.
4. The computer readable medium of claim 1 , wherein the at least one word and the remainder of the subset of words are a predefined distance from each other within the at least one of the plurality of documents.
Within the database indexing system from the initial description, the at least one word and the remainder of the subset of words within the indexed text documents are within a specific proximity of each other in the original documents. This means the words indexed from the node are not randomly selected but are located near one another based on some predefined distance.
5. The computer readable medium of claim 4 , wherein the at least one word and the remainder of the subset of words are consecutive words within the at least one of the plurality of documents.
In the database indexing system where words must be in proximity from the prior description, the at least one word and the remainder of the subset of words are consecutive. This means the words that comprise the key are directly next to each other in the original text document being indexed.
6. The computer readable medium of claim 1 , wherein the data value in each key comprises a path of the respective hierarchical node.
In the database indexing system from the initial description, the data value associated with each key represents the path of the corresponding hierarchical node within the document. This path identifies the node's location in the document's hierarchical structure.
7. The computer readable medium of claim 6 , wherein the path starts from a root node of the text document.
Within the database indexing system using hierarchical node paths from the previous description, the path of the hierarchical node begins at the root node of the text document. This ensures the path represents the complete lineage of the indexed node.
8. The computer readable medium of claim 1 , wherein only a part of the hierarchical nodes of the text documents is indexed.
In the database indexing system from the initial description, the index process only indexes a selection of the hierarchical nodes found in the documents, and does not index every node. Some nodes or levels of nodes may be excluded from the indexing process.
9. The computer readable medium of claim 1 , wherein all of the hierarchical nodes of the text documents are indexed.
In the database indexing system from the initial description, the index process indexes all of the hierarchical nodes found in the documents. This ensures that every node within each text document is represented in the index.
10. A computer implemented method for generating a database index on a computer processing system for indexing a plurality of text documents in a database, the method comprising: execute a database indexing process on the plurality of text documents; creating, by using the computer processing system, a key-value pair, the key including a subset of words from one of the plurality of text documents and a reference to a hierarchical node of the one of the plurality of text documents, the value of the key-value pair including a document reference, wherein the subset of words is separated into multiple elements within the key that comprise at least one word in the subset of words and a remainder of the subset of words; setting the reference to the hierarchical node to a data value related to the hierarchical node that is associated with the subset of words from one of the plurality of text documents; and linking the document reference to the one of the plurality of text documents that includes the subset of words, wherein the at least one word of the subset entry of words as a as the first element for the key.
A computer-implemented method creates a database index for text documents. The method executes a database indexing process. It creates key-value pairs, where the key includes a subset of words from a document and a reference to the hierarchical node those words come from. The value is a document reference. The word subset is split into multiple elements, the first being at least one word and the remainder being the rest of the subset. The node reference is set to a data value related to the node. The document reference links to the document containing the subset of words. The first element of the key contains the first word of the subset.
11. The method of claim 10 , wherein the key is structured in the following order: a first word of the subset of words, the reference to the hierarchical node, and the remainder of words of the subset of words.
In the database indexing method from the previous description, the key is structured in this order: the first word of the word subset, the reference to the hierarchical node that includes the subset of words, and then the remaining words of the word subset, creating the key: [first word, node reference, remaining words].
12. A non-transitory computer readable medium storing instructions for implementing a method of claim 10 .
A non-transitory computer-readable medium stores instructions for executing the database indexing method previously described. This medium allows a computer system to perform the steps of creating the index as defined previously.
13. A database system that includes a database index for indexing text documents, the system comprising: a non-transitory computer readable storage medium configured to store a plurality of text documents, the plurality of text documents including one or more hierarchical nodes that comprise one or more words; and a computer processing system configured to: execute an indexing process on the plurality of text documents; as part of the indexing process, create a key based on a subset of words found in one of the plurality of text documents, the key including a subset of words that occurs in a hierarchical node of the one of the plurality of text documents, and a name entry that is associated with the hierarchical node that includes the subset of words, wherein the subset of words is separated into multiple elements within the key and comprises, as the first element of the key, at least one word in the subset of words, and a remainder of the subset of words as another element within the key; and associate, to the created key, a value that references to the one of the plurality of text documents that includes the hierarchical node with the subset of words, wherein the remainder of words includes at least one word.
A database system includes a database index for text documents. The system has a non-transitory storage medium for text documents containing hierarchical nodes. A computer processing system executes an indexing process. This process creates a key based on a word subset from a document's hierarchical node, and a name entry associated with that node. The subset of words is separated into multiple elements within the key. The first element is at least one word from the subset. The other element includes a remainder of the words from the subset. A value associated with the key references the document containing the node and subset of words. The remaining words part of the subset contains at least one word.
14. The database system of claim 13 , wherein the plurality of documents are XML documents.
In the database system described previously, the plurality of documents being indexed are XML documents. The indexing process is specifically designed to handle the hierarchical nature of XML data.
15. The database system of claim 13 , further comprising a structure index.
The database system from the previous description also contains a structure index. The structure index is in addition to the key-value index already described and probably describes the hierarchical structure itself separately.
16. The database system of claim 13 , wherein the key is structured in the following order: the at least one word in the subset of words, the name entry that is associated with a hierarchical node that includes the subset of words, and the remainder of words from subset of words.
In the database system described earlier, the key is structured in the following order: the at least one word from the subset of words from a node, the name entry that is associated with the hierarchical node that includes the subset of words, and then the remaining words from the subset of words, creating the key: [first word, node name, remaining words].
Unknown
September 2, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.