{"id":"https://openalex.org/W189943346","doi":null,"title":"Design and performance evaluation of a main memory relational database system (t tree)","display_name":"Design and performance evaluation of a main memory relational database system (t tree)","alternate_titles":[],"publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W189943346","mag":"189943346"},"language":"en","primary_location":{"id":"mag:189943346","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=913097","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/W189943346"],"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/A5081243476","display_name":"Tobin J. Lehman","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Tobin J. Lehman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5081243476"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1747,"has_fulltext":false,"cited_by_count":27,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.92175066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":96},"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/T10317","display_name":"Advanced Database Systems and Queries","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.0,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/in-memory-databases","display_name":"in-memory databases","score":0.8489999771118164},{"id":"https://openalex.org/keywords/t-tree","display_name":"TTree","score":0.6890000104904175},{"id":"https://openalex.org/keywords/index-structures","display_name":"index structures","score":0.8270000219345093},{"id":"https://openalex.org/keywords/merge-join","display_name":"merge join","score":0.890999972820282},{"id":"https://openalex.org/keywords/hash-join","display_name":"hash join","score":0.9980000257492065},{"id":"https://openalex.org/keywords/projection-algorithm","display_name":"projection algorithm","score":0.5619999766349792},{"id":"https://openalex.org/keywords/database-recovery","display_name":"database recovery","score":0.7429999709129333},{"id":"https://openalex.org/keywords/demand-recovery","display_name":"demand recovery","score":0.7879999876022339},{"id":"https://openalex.org/keywords/checkpointing","display_name":"checkpointing","score":0.7990000247955322},{"id":"https://openalex.org/keywords/timber-harvesting","display_name":"logging","score":0.8600000143051147},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"concurrency control","score":0.878000020980835},{"id":"https://openalex.org/keywords/locking","display_name":"locking","score":0.41100001335144043},{"id":"https://openalex.org/keywords/database-architecture","display_name":"database architecture","score":0.4779999852180481},{"id":"https://openalex.org/keywords/buffer-pool","display_name":"buffer pool","score":0.4659999907016754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8140596151351929},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.6440064907073975},{"id":"https://openalex.org/C54239708","wikidata":"https://www.wikidata.org/wiki/Q1329910","display_name":"View","level":3,"score":0.5582606792449951},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.5325343608856201},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.524203896522522},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.5159500241279602},{"id":"https://openalex.org/C148840519","wikidata":"https://www.wikidata.org/wiki/Q1049878","display_name":"Database design","level":2,"score":0.514087975025177},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.44583582878112793},{"id":"https://openalex.org/C5968703","wikidata":"https://www.wikidata.org/wiki/Q267136","display_name":"Database model","level":3,"score":0.4406464993953705},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.2572944164276123},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.21904256939888},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13088959455490112}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:189943346","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=913097","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/W2020646533","https://openalex.org/W1598618182","https://openalex.org/W1981969757","https://openalex.org/W2101982608","https://openalex.org/W2612144898","https://openalex.org/W135989943","https://openalex.org/W4238675359","https://openalex.org/W2045943196","https://openalex.org/W2320033573","https://openalex.org/W1668303622"],"abstract_inverted_index":{"Most":[0],"previous":[1],"work":[2,20],"in":[3,105,141,212,361],"the":[4,14,31,74,147,182,222,236,254,270,290,365],"area":[5],"of":[6,16,33,56,73,146,262,334,353],"main":[7,162],"memory":[8,45,163],"database":[9,34,65,78,83,93,164,198,219,223,301,310,340],"systems":[10,79],"has":[11],"focused":[12],"on":[13,307],"problem":[15],"developing":[17],"techniques":[18],"that":[19,169,174,186,244,272,346],"well":[21,140],"with":[22,51,70,112,280,349,355],"a":[23,44,52,63,71,91,98,142,161,170,176,187,196,203,207,225,260,266,286,299,308,350],"very":[24,53],"large":[25],"buffer":[26],"pool.":[27],"This":[28],"dissertation":[29],"addresses":[30],"problems":[32],"architecture":[35,61],"design,":[36],"query":[37],"processing,":[38],"concurrency":[39,294,367],"control,":[40],"and":[41,58,80,110,129,157,185,230,248],"recovery":[42,220,229,249],"for":[43,62,90,103,160,217,293,298,338],"resident":[46],"relational":[47,155],"database,":[48,205],"an":[49],"environment":[50],"different":[54,200,208,297],"set":[55],"costs":[57],"priorities.":[59],"An":[60,342],"memory-resident":[64,77,92,143,197,218,300],"system":[66],"is":[67,108,136,180,192,199,210,242,304,323,344],"presented,":[68],"along":[69],"discussion":[72],"differences":[75],"between":[76],"conventional":[81],"disk-based":[82],"systems.":[84],"Index":[85],"structures":[86,149],"are":[87,150,233,296],"then":[88,151],"studied":[89],"environment.":[94,144,165],"The":[95,133],"T":[96,134,177],"Tree,":[97],"new":[99,240],"index":[100,115,148,179,257],"structure":[101],"designed":[102],"use":[104],"this":[106,213],"environment,":[107],"introduced":[109],"compared":[111],"several":[113,332],"existing":[114],"structures:":[116],"Arrays,":[117],"AVL":[118],"Trees,":[119,121],"B":[120],"Extendible":[122],"Hashing,":[123,125],"Linear":[124,127],"Modified":[126],"Hashing":[128],"Chained":[130],"Bucket":[131],"Hashing.":[132],"Tree":[135,178],"shown":[137],"to":[138,153,235,250,363],"perform":[139],"Several":[145],"used":[152],"examine":[154],"join":[156],"projection":[158],"algorithms":[159],"Experimental":[166],"results":[167],"show":[168],"Merge":[171],"Join":[172,190],"algorithm":[173,191,343],"uses":[175,347],"usually":[181,193],"best":[183],"method,":[184],"simple":[188],"Hash":[189],"second":[194],"best.\r\nRecovering":[195],"from":[201],"recovering":[202],"disk-oriented":[204],"so":[206,228,313],"approach":[209],"taken":[211],"dissertation.":[214],"Existing":[215],"proposals":[216],"treat":[221],"as":[224],"single":[226],"entity,":[227],"checkpoint":[231],"operations":[232],"applied":[234],"entire":[237],"database.":[238],"A":[239],"design":[241],"proposed":[243],"allows":[245],"logging,":[246],"checkpointing":[247],"be":[251,274,316,328],"done":[252],"at":[253],"relation":[255],"or":[256,359],"level,":[258],"providing":[259],"form":[261],"demand":[263],"recovery.":[264],"After":[265],"crash":[267],"transactions":[268],"declare":[269],"relations":[271,282],"must":[273,315],"restored":[275],"before":[276],"they":[277],"can":[278],"run,":[279],"undemanded":[281],"being":[283,357],"recovered":[284],"by":[285],"background":[287],"task.":[288],"Finally,":[289],"cost":[291],"issues":[292],"control":[295],"system.":[302],"Locking":[303],"more":[305,318],"costly":[306],"per":[309],"access":[311],"basis,":[312],"it":[314,326],"made":[317],"efficient.":[319],"Multiple":[320],"granularity":[321],"locking":[322],"desirable,":[324],"but":[325],"would":[327],"too":[329],"expensive":[330],"if":[331],"levels":[333],"locks":[335,348,356],"needed":[336],"checking":[337],"every":[339],"reference.":[341],"presented":[345],"dynamic":[351],"level":[352],"granularity,":[354],"escalated":[358],"de-escalated":[360],"size":[362],"meet":[364],"system's":[366],"requirements.":[368]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W189943346","counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
