{"id":"https://openalex.org/W2970445860","doi":"https://doi.org/10.1109/lisat.2019.8816827","title":"An Efficient, Hybrid, Double-Hash StringMatching Algorithm","display_name":"An Efficient, Hybrid, Double-Hash StringMatching Algorithm","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2970445860","doi":"https://doi.org/10.1109/lisat.2019.8816827","mag":"2970445860"},"language":"en","primary_location":{"id":"doi:10.1109/lisat.2019.8816827","doi":"https://doi.org/10.1109/lisat.2019.8816827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lisat.2019.8816827","pdf_url":null,"source":{"id":"https://openalex.org/S7407088082","display_name":"IEEE Long Island Systems, Applications and Technology Conference (LISAT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Long Island Systems, Applications and Technology Conference (LISAT)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061278630","display_name":"Mehmet Bi\u00e7er","orcid":"https://orcid.org/0000-0001-8699-8892","observed_orcids":["https://orcid.org/0000-0001-8699-8892"]},"institutions":[{"id":"https://openalex.org/I174216632","display_name":"City University of New York","ror":"https://ror.org/00453a208","country_code":"US","type":"education","lineage":["https://openalex.org/I174216632"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehmet Bicer","raw_affiliation_strings":["Department of Computer Science Graduate Center, City University of New York, New York, NY, 10016, U.S.A","Department of Computer Science Graduate Center, City University of New York, New York, NY, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Graduate Center, City University of New York, New York, NY, 10016, U.S.A","institution_ids":["https://openalex.org/I174216632"]},{"raw_affiliation_string":"Department of Computer Science Graduate Center, City University of New York, New York, NY, U.S.A","institution_ids":["https://openalex.org/I174216632"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100362531","display_name":"Xiaowen Zhang","orcid":"https://orcid.org/0000-0003-3825-6995","observed_orcids":["https://orcid.org/0000-0003-3825-6995","https://orcid.org/0009-0007-9787-3076","https://orcid.org/0009-0009-4475-9442"]},"institutions":[{"id":"https://openalex.org/I174216632","display_name":"City University of New York","ror":"https://ror.org/00453a208","country_code":"US","type":"education","lineage":["https://openalex.org/I174216632"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaowen Zhang","raw_affiliation_strings":["Department of Computer Science Graduate Center, City University of New York, New York, NY, 10016, U.S.A","Department of Computer Science Graduate Center, City University of New York, New York, NY, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Graduate Center, City University of New York, New York, NY, 10016, U.S.A","institution_ids":["https://openalex.org/I174216632"]},{"raw_affiliation_string":"Department of Computer Science Graduate Center, City University of New York, New York, NY, U.S.A","institution_ids":["https://openalex.org/I174216632"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174216632"],"apc_list":null,"apc_paid":null,"fwci":0.6466,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.55167959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.9520000219345093},{"id":"https://openalex.org/keywords/double-hashing","display_name":"double hashing","score":0.7889999747276306},{"id":"https://openalex.org/keywords/false-positive-results","display_name":"false positives","score":0.6340000033378601},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"pattern matching","score":0.453000009059906}],"concepts":[{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.8591228127479553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7795178890228271},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7744578123092651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6264353394508362},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.47176507115364075},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.46375563740730286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3606477975845337},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.34701937437057495},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17517000436782837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15755310654640198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07313403487205505},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lisat.2019.8816827","doi":"https://doi.org/10.1109/lisat.2019.8816827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lisat.2019.8816827","pdf_url":null,"source":{"id":"https://openalex.org/S7407088082","display_name":"IEEE Long Island Systems, Applications and Technology Conference (LISAT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Long Island Systems, Applications and Technology Conference (LISAT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1972418517","https://openalex.org/W1986106281","https://openalex.org/W2054418412","https://openalex.org/W2134826720"],"related_works":["https://openalex.org/W2369919536","https://openalex.org/W1974392398","https://openalex.org/W1552046427","https://openalex.org/W4210483963","https://openalex.org/W2364423341","https://openalex.org/W2566537380","https://openalex.org/W2027797516","https://openalex.org/W2140297454","https://openalex.org/W2725860071","https://openalex.org/W2332240909"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"show":[4],"that":[5],"combining":[6],"some":[7],"of":[8,12],"the":[9,13,39,80],"good":[10],"features":[11,30],"existing":[14],"popular":[15],"algorithms":[16],"can":[17],"be":[18],"even":[19],"more":[20],"efficient.":[21],"This":[22],"new":[23],"algorithm":[24,75],"is":[25,71,82],"hybrid":[26],"as":[27,43,45,85],"it":[28,86],"employs":[29],"from":[31],"Boyer-Moore-Horspool,":[32],"Rabin-Karp":[33],"and":[34,51],"Raita":[35],"algorithms.":[36],"We":[37],"compare":[38],"right":[40],"most":[41],"character":[42,53,55,90,92],"well":[44,78],"use":[46],"two":[47],"independent":[48],"hash":[49],"functions":[50],"no":[52],"by":[54,91],"checking":[56,89],"-":[57],"hence":[58],"leaving":[59],"a":[60,65],"very":[61,83],"small":[62],"probability":[63],"for":[64],"false":[66],"positive":[67],"result":[68],"if":[69],"there":[70],"any.":[72],"The":[73],"proposed":[74],"particularly":[76],"does":[77],"when":[79],"pattern":[81],"long":[84],"will":[87],"skip":[88],"comparison.":[93]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2019-09-05T00:00:00"}