PATENT CLAIM ANALYSIS

Application Number: 16046506
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2018-11
Patent Classification: ["707", "803000"]

Abstract:
Methods and systems for creating a compact tree node representation of an XML document. One implementation commences by allocating memory for storing an XML tree index data structure, then allocating another separate portion of memory to store a hash table. Then, traversing an XML document to process the traversed nodes as follows: (a) when the traversed node is an element node, then adding the element node to the XML tree index data structure (b) when the traversed node is a text node, then populating a text node index into the XML tree index data structure and copying the text node values to the hash table, and (c) when the traversed node is an attribute node, then populating an attribute node index into the XML tree index data structure. Such a structure supports fast index-based tree restructuring, and permits very large XML document to be accessed within tight memory size constraints.

Claim (Index 15):
A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process to read, into a memory, a compact tree node representation of an XML document having a tree index data structure and separate node data, the process comprising:\n allocating a first portion of the memory to store an entire XML tree index data structure; allocating a second portion of the memory, the second portion of the memory separate from the first portion of the memory; reading the entire XML tree index data structure into the first portion of the memory, wherein the XML tree index data structure comprises the structure of the XML tree and does not comprise the separate node data; and processing an XML tree index entry, the processing comprising:\n accessing the XML tree index entry to retrieve a reference to at least one node from the separate node data; and \n loading into the second portion of the memory, the at least one node from the separate node data.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 95.0
- Lexical Diversity: 2.3662
- Patent Class: 707.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13459901', '12610047', '13604402', '12690820', '10883483']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2276955464693357
- 35 USC 102 Novelty (BERT): 0.5420225145487177
- Combined Prediction Score: 0.2591282432772739
- Mean Citation Score: 287.34879600000005
- Max Citation Score: 412.07452
- Similarity Product: 328.6916745761204

Labels:
- Claim Label 101: 1
- Claim Label 102: 0
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test