Back to results
US 10,241,979 B2Granted
Accelerated detection of matching patterns
AssigneeOracle International Corporation
InventorsShasank Chavan, Ravi Palakodety, Dennis Lui
Life of this patent
Estimating the term…
Loading patent…
Loading patent…
AssigneeOracle International Corporation
InventorsShasank Chavan, Ravi Palakodety, Dennis Lui
Estimating the term…
Techniques related to accelerated detection of matching patterns are disclosed. In an embodiment, a method may involve, for a single field of a body of records, contiguously storing field values, thereby storing the field values as a concatenation. The method may also involve identifying a match in the concatenation that matches a value pattern specified by a value pattern expression. The value pattern may include a first partial pattern and a second partial pattern. Further, the method may involve determining that the match is contained in a single field value of the body of records. Still further, the method may involve establishing the match as a matching value. The match may be determined to be contained in the single field value based on searching a data structure comprising length information or offset information for a subset of the field values stored as the concatenation.
A method comprising:
A method comprising:
One or more non-transitory storage media storing instructions which, when processed by one or more computing devices, cause:
One or more non-transitory storage media storing instructions, which when processed by one or more computing devices, cause:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
From the US filing history. Foreign family members aren’t listed.
Use of codes for handling textual entities: character encoding
Computing and data processing
About 9 years 9 months of term left · ends 22 Jul 2036 (estimated)
Embodiments relate to information retrieval technology and more specifically, to accelerated detection of matching patterns.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
Pattern matching, such as text pattern matching, is a powerful technique for searching a data source, such as a database and/or a file. For example, using a fragment of a word, pattern matching may return a rich set of results that includes spelling variations, different conjugations of a verb, etc. However, as computer memory capacities increase, so does the amount of stored data. Thus, faster approaches for searching ever increasing amounts of data are beneficial and desirable.
In the drawings:
FIG. 1 depicts an example data source.
FIG. 2A is a flow diagram that depicts an approach for accelerated detection of one or more matching patterns based on searching a plurality of field values as if the plurality of field values were, in effect, a single field value.
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. It will be apparent, however, that the present disclosure may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present disclosure. Modifiers such as “first” and “second” may be used to differentiate elements, but the modifiers do not necessarily indicate any particular order. For example, a second partial pattern may be so named although, in reality, it may correspond to a first, second, and/or third partial pattern.
In an embodiment, detection of a matching pattern may be accelerated by searching a concatenation of discrete values as if the concatenation were, in effect, a single value. The discrete values may be values in a column. Once the matching pattern is detected, it is determined whether the matching pattern occurred within a single discrete value in the concatenation. The determination is based on boundary information defining the boundaries between discrete values in the concatenation.
In an embodiment, the matching pattern may include sub-patterns. The matching pattern may be detected based on searching for each sub-pattern separately.