{"id":"https://openalex.org/W4246116598","doi":"https://doi.org/10.1109/tkde.2006.1599383","title":"q-gram matching using tree models","display_name":"q-gram matching using tree models","publication_year":2006,"publication_date":"2006-03-15","ids":{"openalex":"https://openalex.org/W4246116598","doi":"https://doi.org/10.1109/tkde.2006.1599383"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2006.1599383","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2006.1599383","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5034137329","display_name":"Prahlad Fogla","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Fogla","raw_affiliation_strings":["College of Computing, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"College of Computing, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100689739","display_name":"Woonghee Lee","orcid":"https://orcid.org/0000-0003-0856-6415"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. Lee","raw_affiliation_strings":["College of Computing, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"College of Computing, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034137329"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.4518,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78116169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"4","first_page":"433","last_page":"447"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9990000128746033,"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.8086593151092529},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.7839425802230835},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.6652047634124756},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.6402060389518738},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.6398311853408813},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.6276229619979858},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5642468929290771},{"id":"https://openalex.org/keywords/intrusion-detection-system","display_name":"Intrusion detection system","score":0.5208752155303955},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5197979211807251},{"id":"https://openalex.org/keywords/n-gram","display_name":"n-gram","score":0.50677090883255},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.498241662979126},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.49504223465919495},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.47099441289901733},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.36395326256752014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32033276557922363},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.30498653650283813},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.19492533802986145},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19294920563697815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15789836645126343}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8086593151092529},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.7839425802230835},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.6652047634124756},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.6402060389518738},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6398311853408813},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.6276229619979858},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5642468929290771},{"id":"https://openalex.org/C35525427","wikidata":"https://www.wikidata.org/wiki/Q745881","display_name":"Intrusion detection system","level":2,"score":0.5208752155303955},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5197979211807251},{"id":"https://openalex.org/C117884012","wikidata":"https://www.wikidata.org/wiki/Q94489","display_name":"n-gram","level":3,"score":0.50677090883255},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.498241662979126},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.49504223465919495},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.47099441289901733},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.36395326256752014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32033276557922363},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.30498653650283813},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.19492533802986145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19294920563697815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15789836645126343},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/tkde.2006.1599383","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2006.1599383","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.47999998927116394,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1501129459","https://openalex.org/W1515216880","https://openalex.org/W1520663999","https://openalex.org/W1557390898","https://openalex.org/W1887000090","https://openalex.org/W1972418517","https://openalex.org/W1973130965","https://openalex.org/W1980038595","https://openalex.org/W1985108724","https://openalex.org/W1987426253","https://openalex.org/W2001496424","https://openalex.org/W2043481183","https://openalex.org/W2045821558","https://openalex.org/W2059513841","https://openalex.org/W2082092341","https://openalex.org/W2091929432","https://openalex.org/W2095646789","https://openalex.org/W2099964107","https://openalex.org/W2121252285","https://openalex.org/W2134826720","https://openalex.org/W2168459716","https://openalex.org/W2533248932","https://openalex.org/W3136767761","https://openalex.org/W4212954813","https://openalex.org/W6633180349","https://openalex.org/W6639582041"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W2351720606","https://openalex.org/W2359095153","https://openalex.org/W232438323","https://openalex.org/W2083751087","https://openalex.org/W1786504122","https://openalex.org/W2107061999","https://openalex.org/W2133432734","https://openalex.org/W4246116598","https://openalex.org/W2158047509"],"abstract_inverted_index":{"q-gram":[0,32,74,92],"matching":[1,7],"is":[2],"used":[3,89,104],"for":[4,72,90,105],"approximate":[5],"substring":[6],"problems":[8],"in":[9,37,42],"a":[10,24,43,51],"wide":[11],"range":[12],"of":[13,60,97],"application":[14],"areas,":[15],"including":[16],"intrusion":[17,106],"detection.":[18,107],"In":[19],"this":[20],"paper,":[21],"we":[22],"present":[23,36,95],"tree-based":[25],"model":[26],"to":[27,47,56],"perform":[28],"fast":[29,73],"linear":[30],"time":[31],"matching.":[33,78],"All":[34],"q-grams":[35],"the":[38,58,61,84],"text":[39],"are":[40],"stored":[41],"tree":[44,52,62],"structure":[45],"similar":[46],"trie.":[48],"We":[49,67,79,94],"use":[50,69],"redundancy":[53],"pruning":[54],"algorithm":[55],"reduce":[57],"size":[59],"without":[63],"losing":[64],"any":[65],"information.":[66],"also":[68],"suffix":[70],"links":[71],"search":[75],"during":[76],"query":[77],"compare":[80],"our":[81],"work":[82],"with":[83],"Rabin-Karp-based":[85],"hash-table":[86],"technique,":[87],"commonly":[88],"multiple":[91],"search.":[93],"results":[96],"experiments":[98],"on":[99],"system":[100],"call":[101],"sequence":[102],"data":[103]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}