{"id":"https://openalex.org/W2072065872","doi":"https://doi.org/10.1109/icdse.2014.6974624","title":"Adaptive hashing based multiple variable length pattern search algorithm for large data sets","display_name":"Adaptive hashing based multiple variable length pattern search algorithm for large data sets","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2072065872","doi":"https://doi.org/10.1109/icdse.2014.6974624","mag":"2072065872"},"language":"en","primary_location":{"id":"doi:10.1109/icdse.2014.6974624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdse.2014.6974624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Data Science & Engineering (ICDSE)","raw_type":"proceedings-article"},"type":"article","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/A5069603439","display_name":"Punit Kanuga","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Punit Kanuga","raw_affiliation_strings":["Department of Information Technology, Delhi Technological University (formerly DCE), Delhi, India","Department of Information Technology, Delhi Technological University (formerly DCE) Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Delhi Technological University (formerly DCE), Delhi, India","institution_ids":["https://openalex.org/I863896202"]},{"raw_affiliation_string":"Department of Information Technology, Delhi Technological University (formerly DCE) Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112639641","display_name":"Anamika Chauhan","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anamika Chauhan","raw_affiliation_strings":["Department of Information Technology, Delhi Technological University (formerly DCE), Delhi, India","Department of Information Technology, Delhi Technological University (formerly DCE) Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Delhi Technological University (formerly DCE), Delhi, India","institution_ids":["https://openalex.org/I863896202"]},{"raw_affiliation_string":"Department of Information Technology, Delhi Technological University (formerly DCE) Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2687,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85345045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":null,"first_page":"130","last_page":"135"},"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/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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/1702","display_name":"Artificial Intelligence"},"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6918371915817261},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6649572849273682},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5989031791687012},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5932210683822632},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5576460361480713},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.45862501859664917},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.415914386510849},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.38385510444641113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21777907013893127},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.14938345551490784}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6918371915817261},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6649572849273682},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5989031791687012},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5932210683822632},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5576460361480713},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.45862501859664917},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.415914386510849},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38385510444641113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21777907013893127},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.14938345551490784},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdse.2014.6974624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdse.2014.6974624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Data Science & Engineering (ICDSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W124244495","https://openalex.org/W223785737","https://openalex.org/W1569691642","https://openalex.org/W1577337656","https://openalex.org/W1972418517","https://openalex.org/W1985108724","https://openalex.org/W2035593393","https://openalex.org/W2054701320","https://openalex.org/W2068437548","https://openalex.org/W2096258819","https://openalex.org/W2099964107","https://openalex.org/W2132365957","https://openalex.org/W2134826720","https://openalex.org/W2153998118","https://openalex.org/W2160907800","https://openalex.org/W2521852212","https://openalex.org/W3140431821","https://openalex.org/W6605045863","https://openalex.org/W6634246751","https://openalex.org/W6679598126","https://openalex.org/W7038196945"],"related_works":["https://openalex.org/W2811247857","https://openalex.org/W2136399778","https://openalex.org/W102859714","https://openalex.org/W4298343607","https://openalex.org/W2334522381","https://openalex.org/W2040748620","https://openalex.org/W2951881567","https://openalex.org/W1551533237","https://openalex.org/W1835589799","https://openalex.org/W4385261619"],"abstract_inverted_index":{"Searching":[0],"of":[1,9,29,43,45,91,104,112,119],"patterns":[2,33,58,113],"in":[3,34,52],"large":[4,35],"data":[5,16,36,89,120],"sets":[6],"is":[7],"need":[8],"the":[10,82],"hour":[11],"to":[12,114],"extract":[13],"knowledge":[14],"from":[15],"warehouses.":[17],"This":[18],"paper":[19],"presents":[20],"a":[21],"new":[22],"hashing":[23],"based":[24],"algorithm":[25,106],"for":[26,48,68,88,101],"fast":[27],"search":[28,63],"multiple":[30],"variable":[31],"length":[32,85,92,118],"sets.":[37],"It":[38,54],"rules":[39],"out":[40],"traditional":[41],"way":[42],"generation":[44],"shift":[46],"table":[47],"each":[49],"character":[50],"present":[51],"pattern.":[53],"can":[55],"also":[56],"accommodate":[57],"which":[59],"come":[60],"up":[61],"during":[62,97],"time,":[64],"thus":[65],"works":[66],"well":[67,72],"both":[69],"pre-determined":[70],"as":[71,73,81],"dynamic":[74],"pattern":[75,84],"set.":[76],"Furthermore,":[77],"its":[78],"speed":[79],"enhances":[80],"minimum":[83],"P":[86],"increases":[87],"set":[90,121],"n":[93],"taking":[94],"O(n/P)":[95],"time":[96],"search.":[98],"Experimental":[99],"results":[100],"runtime":[102],"behavior":[103],"presented":[105],"with":[107],"varying":[108],"parameters":[109],"like":[110],"number":[111],"be":[115],"searched":[116],"and":[117],"extended":[122],"upto":[123],"(but":[124],"not":[125],"limited":[126],"to)":[127],"200,000":[128],"characters":[129],"are":[130],"produced.":[131]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}