{"id":"https://openalex.org/W43866366","doi":null,"title":"Concurrent algorithms for search structures (parallel, database)","display_name":"Concurrent algorithms for search structures (parallel, database)","alternate_titles":[],"publication_year":1984,"publication_date":"1984-01-01","ids":{"openalex":"https://openalex.org/W43866366","mag":"43866366"},"language":"en","primary_location":{"id":"mag:43866366","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=911560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W43866366"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5055576104","display_name":"Dennis E. Shasha","orcid":"https://orcid.org/0000-0002-7036-3312","observed_orcids":["https://orcid.org/0000-0002-7036-3312"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Dennis Shasha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5055576104"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.47440001368522644,"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":0.47440001368522644,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.39750000834465027,"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/T11269","display_name":"Algorithms and Data Compression","score":0.07800000160932541,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/concurrent-algorithms","display_name":"concurrent algorithms","score":0.9150000214576721},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-trees","score":0.9179999828338623},{"id":"https://openalex.org/keywords/range-queries","display_name":"range queries","score":0.9649999737739563},{"id":"https://openalex.org/keywords/virtual-machines","display_name":"virtual machines","score":0.546999990940094},{"id":"https://openalex.org/keywords/algorithm-simulation","display_name":"algorithm simulation","score":0.515999972820282},{"id":"https://openalex.org/keywords/parallel-data-structures","display_name":"parallel data structures","score":0.5379999876022339},{"id":"https://openalex.org/keywords/database-concurrency","display_name":"database concurrency","score":0.31200000643730164}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7799937725067139},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6258915066719055},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6152219772338867},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6010878086090088},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5334560871124268},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5112965106964111},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5065368413925171},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4875280559062958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46026259660720825},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2669574022293091}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:43866366","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=911560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2036122593","https://openalex.org/W3167709386","https://openalex.org/W2128896110","https://openalex.org/W6910265733","https://openalex.org/W2007049062","https://openalex.org/W1157540918","https://openalex.org/W7099371258","https://openalex.org/W7095242457","https://openalex.org/W2299122934","https://openalex.org/W2776556322"],"abstract_inverted_index":{"A":[0],"search":[1,24,37,67,95,123,205,215,254],"structure":[2,6,38,50,255],"is":[3,39,51,116,143,161,166,247],"a":[4,17,32,36,40,44,49,56,79,91,98,153,172,184,258],"data":[5],"that":[7,146,164,177],"supports":[8],"operations":[9],"such":[10,48,84],"as":[11,107,183],"search,":[12],"insert,":[13],"and":[14,29,61,77,97,203,223],"delete":[15],"on":[16,102,110,269],"set":[18],"of":[19,23,63,132,137,159,186,239,243,252,260],"items.":[20],"Common":[21],"examples":[22],"structures":[25,124],"include":[26],"lists,":[27],"B-trees,":[28,199],"hash":[30,201],"structures.\r\nDesigning":[31],"sequential":[33],"algorithm":[34,46],"for":[35,47,58,66,94,198,211,216],"well-understood":[41],"problem.":[42],"Designing":[43],"concurrent":[45,64,173,209,253],"not.":[52],"This":[53],"thesis":[54],"proposes":[55],"framework":[57,76,86],"the":[59,111,114,144,157,180,237,244,250],"design":[60,232],"analysis":[62],"algorithms":[65,73,197,210,226,256],"structures.":[68,206],"It":[69],"presents":[70],"several":[71,135],"new":[72,196],"using":[74],"this":[75],"describes":[78],"simulation":[80,245],"kit":[81,246],"to":[82,121,130,162,192,248],"evaluate":[83,249],"algorithms.\r\nThe":[85],"has":[87,152],"two":[88],"salient":[89],"features:":[90],"general":[92],"model":[93,115],"structures;":[96],"correctness":[99],"criterion":[100],"based":[101],"specifications.\r\nWe":[103,194],"express":[104],"algorithmic":[105],"techniques":[106,119],"program":[108],"fragments":[109],"model.":[112],"Because":[113],"general,":[117],"these":[118],"apply":[120],"all":[122,217],"we":[125,265],"know":[126],"of.\r\nWe":[127],"consider":[128],"computations":[129],"consist":[131],"actions":[133,189],"at":[134],"levels":[136],"virtual":[138],"machines.":[139],"The":[140],"highest":[141],"level":[142,188],"one":[145,230],"users":[147],"interact":[148],"with.":[149],"Each":[150],"action":[151],"specification.":[154],"For":[155],"example,":[156,264],"specification":[158],"insert(x)":[160],"ensure":[163],"x":[165],"in":[167],"some":[168],"set.":[169],"We":[170,207],"verify":[171],"computation":[174],"by":[175,235],"showing":[176],"it":[178],"produces":[179],"same":[181],"result":[182],"sequence":[185],"user":[187],"performing":[190],"according":[191],"their":[193],"present":[195],"multi-directory":[200],"structures,":[202],"other":[204],"introduce":[208],"range":[212],"queries,":[213],"e.g.":[214],"items":[218],"with":[219],"keys":[220],"between":[221],"100":[222],"110.":[224],"These":[225],"are":[227],"only":[228],"examples;":[229],"can":[231],"many":[233],"more":[234],"following":[236],"guidelines":[238],"our":[240],"framework.\r\nThe":[241],"purpose":[242],"performance":[251],"under":[257],"variety":[259],"conditions.":[261],"As":[262],"an":[263,267],"describe":[266],"experiment":[268],"eight":[270],"B-tree":[271],"algorithms.":[272]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W43866366","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
