Method and apparatus for fast and scalable matching of structured data streams
AssigneeOracle America, Inc.
InventorsChristoph L. Schuba, Sumantra R. Kundu, Jason L. Goldschmidt
Life of this patent
Estimating the term…
Loading patent…
AssigneeOracle America, Inc.
InventorsChristoph L. Schuba, Sumantra R. Kundu, Jason L. Goldschmidt
Estimating the term…
One embodiment of the present invention provides a system that classifies elements in a structured data stream. Upon receiving an element from the structured data stream, the system applies a hash function to the element to generate a single hash value. Next, the system divides the single hash value into multiple sections, and uses the multiple sections as inputs to a Bloom filter to determine if a node for the element exists in an associated lookup structure. If so, the system looks up the node for the element in the associated lookup structure. Note that using the Bloom filter in this way prevents unnecessary lookups. Furthermore, using multiple sections of a single hash value as inputs to the Bloom filter eliminates the need to compute multiple hash values.
A method for classifying elements in a structured data stream, comprising:
A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for classifying elements in a structured data stream, the method comprising:
An apparatus that classifies elements in a structured data stream, comprising:
Dependencies are inferred from the claim text.