Method and data structure for performing regular expression searches in a fixed length word language

Method and data structure for performing regular expression searches in a fixed length word language

Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the "?" sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matchin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Finkelstein, Amit
Format: Patent
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Finkelstein, Amit
description Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the "?" sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.
format Patent
fullrecord <record><control><sourceid>uspatents_EFH</sourceid><recordid>TN_cdi_uspatents_grants_06996562</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>06996562</sourcerecordid><originalsourceid>FETCH-uspatents_grants_069965623</originalsourceid><addsrcrecordid>eNqNyjEKwkAQRuE0FqLe4b-AIIqB1BKxsbOXITvZLMTZMDOLOb4RPIDV94q3rsKdfcgBJAGBnGCupfOijD4rJtaFV5II5VhGUvA8KZulLDAm7QY2JAGhTzMHjCzRB7yzLk0SC0XeVqueRuPdz02Fa_u43PbFJnIWt2dU-nKom6Y-18fTH8sHsP5ACA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and data structure for performing regular expression searches in a fixed length word language</title><source>USPTO Issued Patents</source><creator>Finkelstein, Amit</creator><creatorcontrib>Finkelstein, Amit ; Microsoft Corporation</creatorcontrib><description>Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the "?" sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.</description><language>eng</language><creationdate>2006</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/6996562$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,780,802,885,64039</link.rule.ids><linktorsrc>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/6996562$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Finkelstein, Amit</creatorcontrib><creatorcontrib>Microsoft Corporation</creatorcontrib><title>Method and data structure for performing regular expression searches in a fixed length word language</title><description>Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the "?" sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2006</creationdate><recordtype>patent</recordtype><sourceid>EFH</sourceid><recordid>eNqNyjEKwkAQRuE0FqLe4b-AIIqB1BKxsbOXITvZLMTZMDOLOb4RPIDV94q3rsKdfcgBJAGBnGCupfOijD4rJtaFV5II5VhGUvA8KZulLDAm7QY2JAGhTzMHjCzRB7yzLk0SC0XeVqueRuPdz02Fa_u43PbFJnIWt2dU-nKom6Y-18fTH8sHsP5ACA</recordid><startdate>20060207</startdate><enddate>20060207</enddate><creator>Finkelstein, Amit</creator><scope>EFH</scope></search><sort><creationdate>20060207</creationdate><title>Method and data structure for performing regular expression searches in a fixed length word language</title><author>Finkelstein, Amit</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_grants_069965623</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2006</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Finkelstein, Amit</creatorcontrib><creatorcontrib>Microsoft Corporation</creatorcontrib><collection>USPTO Issued Patents</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Finkelstein, Amit</au><aucorp>Microsoft Corporation</aucorp><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and data structure for performing regular expression searches in a fixed length word language</title><date>2006-02-07</date><risdate>2006</risdate><abstract>Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the "?" sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_uspatents_grants_06996562
source USPTO Issued Patents
title Method and data structure for performing regular expression searches in a fixed length word language
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T14%3A14%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFH&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Finkelstein,%20Amit&rft.aucorp=Microsoft%20Corporation&rft.date=2006-02-07&rft_id=info:doi/&rft_dat=%3Cuspatents_EFH%3E06996562%3C/uspatents_EFH%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true