[
https://issues.apache.org/jira/browse/AVRO-2703?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17116678#comment-17116678
]
ASF subversion and git services commented on AVRO-2703:
-------------------------------------------------------
Commit 6f431fa1717b4557768cb274524874d064485dfc in avro's branch
refs/heads/master from belugabehr
[ https://gitbox.apache.org/repos/asf?p=avro.git;h=6f431fa ]
AVRO-2703: Use KMP Algorithm For Sync Marker Search (#782)
* AVRO-2703: Use KMP Algorithm For Sync Marker Search
* Use different implementation to compute partial match table
Co-authored-by: David Mollitor <[email protected]>
> Use KMP Algorithm For Sync Marker Search
> ----------------------------------------
>
> Key: AVRO-2703
> URL: https://issues.apache.org/jira/browse/AVRO-2703
> Project: Apache Avro
> Issue Type: Improvement
> Reporter: David Mollitor
> Assignee: David Mollitor
> Priority: Major
>
> Use the [Knuth-Morris-Pratt
> algorithm|https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm]
> to search an Avro file for the sequence boundary instead of the current
> naive approach based on a circular buffer.
> bq. The KMP algorithm has a better worst-case performance than the
> straightforward algorithm
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
