{"id":"https://openalex.org/W4400233768","doi":"https://doi.org/10.1109/noms59830.2024.10575228","title":"Enhancing Network Data Plane Analysis with Native Graph Database","display_name":"Enhancing Network Data Plane Analysis with Native Graph Database","publication_year":2024,"publication_date":"2024-05-06","ids":{"openalex":"https://openalex.org/W4400233768","doi":"https://doi.org/10.1109/noms59830.2024.10575228"},"language":"en","primary_location":{"id":"doi:10.1109/noms59830.2024.10575228","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/noms59830.2024.10575228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2024-2024 IEEE Network Operations and Management Symposium","raw_type":"proceedings-article"},"type":"conference-paper","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/A5002622547","display_name":"Amar Abane","orcid":"https://orcid.org/0000-0002-0094-5907"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amar Abane","raw_affiliation_strings":["NIST,Maryland,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NIST,Maryland,USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024100219","display_name":"Abdella Battou","orcid":"https://orcid.org/0000-0003-3071-842X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abdella Battou","raw_affiliation_strings":["NIST,Maryland,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NIST,Maryland,USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021987049","display_name":"Mheni Merzouki","orcid":"https://orcid.org/0000-0002-9267-5827"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mheni Merzouki","raw_affiliation_strings":["NIST,Maryland,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NIST,Maryland,USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9326000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7603981494903564},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.6070309281349182},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4672890305519104},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.4460245668888092},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22539180517196655}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7603981494903564},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.6070309281349182},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4672890305519104},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.4460245668888092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22539180517196655}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/noms59830.2024.10575228","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/noms59830.2024.10575228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2024-2024 IEEE Network Operations and Management Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W95608104","https://openalex.org/W2064322639","https://openalex.org/W2111828771","https://openalex.org/W2492337463","https://openalex.org/W2808261072","https://openalex.org/W2914189542","https://openalex.org/W2982608089","https://openalex.org/W3005038143","https://openalex.org/W3101248335","https://openalex.org/W4233458882","https://openalex.org/W4302307002","https://openalex.org/W6606536520","https://openalex.org/W6639592347","https://openalex.org/W6686667945","https://openalex.org/W6775007155"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W3115442681","https://openalex.org/W2391000461"],"abstract_inverted_index":{"As":[0],"modern":[1],"networks":[2],"grow":[3],"in":[4,33],"complexity,":[5],"ensuring":[6],"their":[7],"reliability":[8],"and":[9,36,61,67,75,101],"security":[10],"becomes":[11],"increasingly":[12],"vital.":[13],"Data":[14],"plane":[15,28,47],"analysis":[16,29,48,84],"is":[17],"a":[18,45,51,58],"key":[19],"process":[20],"for":[21],"verifying":[22],"network":[23,65,82],"behavior,":[24],"but":[25],"traditional":[26],"data":[27,46],"tools":[30,103],"face":[31],"challenges":[32],"extensibility,":[34],"customization,":[35],"interoperability.":[37],"This":[38],"paper":[39],"explores":[40],"the":[41,70,81,105],"potential":[42],"of":[43],"implementing":[44],"system":[49],"on":[50,104],"general-purpose":[52],"native":[53],"graph":[54,71,77],"database,":[55],"to":[56,64],"create":[57],"more":[59,99],"uniform":[60],"insightful":[62],"approach":[63],"verification":[66],"analysis.":[68],"Using":[69],"database":[72],"query":[73],"language":[74],"built-in":[76],"algorithms,":[78],"we":[79],"simplify":[80],"forwarding":[83],"while":[85],"enhancing":[86],"its":[87],"features.":[88],"Our":[89],"study":[90],"offers":[91],"practical":[92],"insights":[93],"into":[94],"managing":[95],"complex":[96],"networks,":[97],"promising":[98],"efficient":[100],"intuitive":[102],"horizon.":[106]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}