{"id":"https://openalex.org/W4377842876","doi":"https://doi.org/10.1145/3579142.3594293","title":"Design of Highly Scalable Graph Database Systems without Exponential Performance Degradation","display_name":"Design of Highly Scalable Graph Database Systems without Exponential Performance Degradation","publication_year":2023,"publication_date":"2023-05-23","ids":{"openalex":"https://openalex.org/W4377842876","doi":"https://doi.org/10.1145/3579142.3594293"},"language":"en","primary_location":{"id":"doi:10.1145/3579142.3594293","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3579142.3594293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Workshop on Big Data in Emergent Distributed Environments","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/A5053672295","display_name":"Ricky Sun","orcid":"https://orcid.org/0009-0004-3025-4500"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ricky Sun","raw_affiliation_strings":["R&D, Ultipa, San Ramon, California, USA"],"affiliations":[{"raw_affiliation_string":"R&D, Ultipa, San Ramon, California, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072347449","display_name":"Jamie Chen","orcid":"https://orcid.org/0009-0009-1759-681X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jamie Chen","raw_affiliation_strings":["R&D, Ultipa, Pleasanton, USA"],"affiliations":[{"raw_affiliation_string":"R&D, Ultipa, Pleasanton, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053672295"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4814,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63729208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9958000183105469,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8522597551345825},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6946088075637817},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6941969394683838},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.6515215635299683},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.519295871257782},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5050488114356995},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4853760004043579},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4242135286331177},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.4135821461677551},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41231268644332886},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.20186716318130493},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.18848362565040588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14790493249893188}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8522597551345825},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6946088075637817},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6941969394683838},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.6515215635299683},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.519295871257782},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5050488114356995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4853760004043579},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4242135286331177},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.4135821461677551},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41231268644332886},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.20186716318130493},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.18848362565040588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14790493249893188}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3579142.3594293","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3579142.3594293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Workshop on Big Data in Emergent Distributed Environments","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1571465197","https://openalex.org/W1971300161","https://openalex.org/W2066636486","https://openalex.org/W2166338096","https://openalex.org/W2170616854","https://openalex.org/W2886783363","https://openalex.org/W2921706489","https://openalex.org/W3028820942","https://openalex.org/W3040973301","https://openalex.org/W3198682658","https://openalex.org/W4251393250","https://openalex.org/W4284967996","https://openalex.org/W4320855715"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W170547082","https://openalex.org/W1901747001"],"abstract_inverted_index":{"The":[0,115,147,169],"main":[1],"challenge":[2],"faced":[3],"by":[4],"today's":[5],"graph":[6,39,49,68,105,111],"database":[7,106],"systems":[8,17],"is":[9],"sacrificing":[10],"performance":[11],"(computation)":[12],"for":[13,100,155],"scalability":[14],"(storage).":[15],"Such":[16],"probably":[18],"can":[19],"store":[20],"a":[21,74,141],"large":[22,65],"amount":[23,66],"of":[24,64,67,97],"data":[25,112,134,156,162,181,198],"across":[26,165,204],"many":[27],"instances":[28],"but":[29],"can't":[30],"offer":[31],"adequate":[32],"graph-computing":[33],"power":[34],"to":[35,61,72,81,130,179,183,190],"deeply":[36],"penetrate":[37],"dynamic":[38],"dataset":[40],"in":[41,140],"real":[42],"time.":[43],"A":[44],"seemingly":[45],"simple":[46],"and":[47,102,136,143,158,174],"intuitive":[48],"query":[50],"like":[51],"K-hop":[52],"traversal":[53,63,139],"or":[54],"finding":[55],"all":[56,166],"shortest":[57],"paths":[58],"may":[59],"lead":[60],"deep":[62],"data,":[69],"which":[70],"tends":[71],"cause":[73],"typical":[75],"BSP":[76],"(Bulky":[77],"Synchronous":[78],"Processing)":[79],"system":[80],"exchange":[82],"heavily":[83],"amongst":[84],"its":[85],"distributed":[86,101,121],"instances,":[87],"therefore":[88],"causing":[89],"significant":[90],"latencies.":[91],"This":[92],"paper":[93],"proposes":[94],"three":[95],"schools":[96],"architectural":[98],"designs":[99],"horizontally":[103],"scalable":[104],"while":[107],"achieving":[108],"highly":[109],"performant":[110],"processing":[113,163],"capabilities.":[114],"first":[116],"school,":[117,149],"coined":[118],"HTAP,":[119],"augments":[120],"consensus":[122],"algorithm":[123],"RAFT":[124],"paired":[125],"with":[126],"vector-based":[127],"computing":[128],"acceleration":[129],"achieve":[131,191],"fast":[132],"online":[133],"ingestion":[135],"real-time":[137],"deep-data":[138],"TP":[142],"AP":[144],"hybrid":[145],"mode.":[146],"second":[148],"named":[150],"as":[151],"GRID,":[152],"leverages":[153],"human-intelligence":[154],"partitioning,":[157],"preserving":[159],"the":[160],"HTAP":[161],"capabilities":[164],"partitioned":[167],"clusters.":[168,206],"last":[170],"school":[171],"incorporates":[172],"SHARD":[173],"advanced":[175],"GQL":[176],"optimization":[177],"techniques":[178],"allow":[180],"partitioning":[182],"be":[184],"done":[185],"fully":[186],"automated":[187],"yet":[188],"strive":[189],"lower":[192],"latency":[193],"via":[194],"minimum":[195],"I/O":[196],"cost":[197],"migration":[199],"model":[200],"when":[201],"queries":[202],"spread":[203],"multiple":[205]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}