{"id":"https://openalex.org/W2150715348","doi":"https://doi.org/10.1137/0214004","title":"The Complexity of Distributed Concurrency Control","display_name":"The Complexity of Distributed Concurrency Control","publication_year":1985,"publication_date":"1985-02-01","ids":{"openalex":"https://openalex.org/W2150715348","doi":"https://doi.org/10.1137/0214004","mag":"2150715348"},"language":"en","primary_location":{"id":"doi:10.1137/0214004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/123456789/22421","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110195580","display_name":"Paris C. Kanellakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paris C. Kanellakis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110195580"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.283506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"1","first_page":"52","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9872000217437744,"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.7668532133102417},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.756739616394043},{"id":"https://openalex.org/keywords/timestamp-based-concurrency-control","display_name":"Timestamp-based concurrency control","score":0.6793575882911682},{"id":"https://openalex.org/keywords/optimistic-concurrency-control","display_name":"Optimistic concurrency control","score":0.6105273962020874},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.587045431137085},{"id":"https://openalex.org/keywords/distributed-concurrency-control","display_name":"Distributed concurrency control","score":0.5421687960624695},{"id":"https://openalex.org/keywords/multiversion-concurrency-control","display_name":"Multiversion concurrency control","score":0.5322798490524292},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5122038722038269},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5036160349845886},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5033227801322937},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4535664916038513},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44564804434776306},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.44100168347358704},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3409350514411926},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20049422979354858},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18829628825187683},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.11413639783859253}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7668532133102417},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.756739616394043},{"id":"https://openalex.org/C35819235","wikidata":"https://www.wikidata.org/wiki/Q186868","display_name":"Timestamp-based concurrency control","level":5,"score":0.6793575882911682},{"id":"https://openalex.org/C79240183","wikidata":"https://www.wikidata.org/wiki/Q1779327","display_name":"Optimistic concurrency control","level":5,"score":0.6105273962020874},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.587045431137085},{"id":"https://openalex.org/C208087996","wikidata":"https://www.wikidata.org/wiki/Q5283142","display_name":"Distributed concurrency control","level":4,"score":0.5421687960624695},{"id":"https://openalex.org/C108744092","wikidata":"https://www.wikidata.org/wiki/Q93695","display_name":"Multiversion concurrency control","level":5,"score":0.5322798490524292},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5122038722038269},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5036160349845886},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5033227801322937},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4535664916038513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44564804434776306},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.44100168347358704},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3409350514411926},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20049422979354858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18829628825187683},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.11413639783859253}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0214004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/22421","is_oa":true,"landing_page_url":"http://hdl.handle.net/123456789/22421","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM JOURNAL ON COMPUTING","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/22421","is_oa":true,"landing_page_url":"http://hdl.handle.net/123456789/22421","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM JOURNAL ON COMPUTING","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1963979953","https://openalex.org/W1965172764","https://openalex.org/W1987537656","https://openalex.org/W1991199257","https://openalex.org/W1993505169","https://openalex.org/W2009998184","https://openalex.org/W2023304911","https://openalex.org/W2042714866","https://openalex.org/W2110765100","https://openalex.org/W2788164529","https://openalex.org/W3137220996","https://openalex.org/W4211008702"],"related_works":["https://openalex.org/W2088566435","https://openalex.org/W2083731697","https://openalex.org/W2185292415","https://openalex.org/W2907808821","https://openalex.org/W3006329082","https://openalex.org/W1489494763","https://openalex.org/W2002748598","https://openalex.org/W2067467620","https://openalex.org/W2105700867","https://openalex.org/W1974150465"],"abstract_inverted_index":{"We":[0,88,115],"present":[1],"a":[2,47,100,112,129],"formal":[3],"framework":[4],"for":[5],"distributed":[6,48,155],"databases,":[7],"and":[8,59,75,96,135],"we":[9,141],"study":[10],"the":[11,14,32,36,55,65,69,77,82,86,91,108,144,150],"complexity":[12,67,148],"of":[13,27,35,52,54,68,79,85,93,103,111,149],"concurrency":[15,40,156],"control":[16,41,157],"problem":[17],"in":[18,147],"this":[19,118],"framework.":[20],"Our":[21],"transactions":[22],"are":[23,57],"partially":[24],"ordered":[25],"sets":[26],"actions,":[28],"as":[29],"opposed":[30],"to":[31,73,98,107,154],"straight-line":[33],"programs":[34],"centralized":[37,153],"case.":[38],"The":[39],"algorithm,":[42],"or":[43],"scheduler,":[44],"is":[45,105,120],"itself":[46],"program.":[49],"Three":[50],"notions":[51],"performance":[53],"scheduler":[56,130],"studied":[58],"interrelated:":[60],"(1)":[61],"its":[62],"parallelism,":[63],"(2)":[64],"computational":[66],"problems":[70],"it":[71],"needs":[72],"solve":[74],"(3)":[76],"cost":[78],"communication":[80,134],"between":[81],"various":[83],"parts":[84],"scheduler.":[87],"show":[89,116],"that":[90,117],"number":[92],"messages":[94],"necessary":[95],"sufficient":[97],"support":[99],"given":[101],"level":[102],"parallelism":[104],"equal":[106],"minimax":[109],"value":[110],"combinatorial":[113],"game.":[114],"game":[119],"PSPACE-complete.":[121],"It":[122],"follows":[123],"that,":[124],"unless":[125],"$\\text{NP}":[126],"=":[127],"\\text{PSPACE}$,":[128],"cannot":[131],"simultaneously":[132],"minimize":[133],"be":[136],"computationally":[137],"efficient.":[138],"This":[139],"result,":[140],"argue,":[142],"captures":[143],"quantum":[145],"jump":[146],"transition":[151],"from":[152],"problems.":[158]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}