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 7):
The computer implemented method of  claim 1 , wherein the XML tree index data structure comprises an XML tree index for next sibling.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2501559734336015
- 35 USC 102 Novelty (BERT): 0.542477265533966
- Combined Prediction Score: 0.279388102643638
- Mean Citation Score: 287.34879600000005
- Max Citation Score: 412.07452
- Similarity Product: 304.3939348569274

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

Dataset: test