Fundamenta Informaticae最新文献_第2页

Adaptive Merging on Phase Change Memory 相变存储器的自适应归并

4区计算机科学

Fundamenta Informaticae Pub Date : 2023-03-15 DOI: 10.3233/fi-222144

Wojciech Macyna, Michal Kukowski

{"title":"Adaptive Merging on Phase Change Memory","authors":"Wojciech Macyna, Michal Kukowski","doi":"10.3233/fi-222144","DOIUrl":"https://doi.org/10.3233/fi-222144","url":null,"abstract":"Indexing is a well-known database technique used to facilitate data access and speed up query processing. Nevertheless, the construction and modification of indexes are very expensive. In traditional approaches, all records in the database table are equally covered by the index. It is not effective, since some records may be queried very often and some never. To avoid this problem, adaptive merging has been introduced. The key idea is to create an index adaptively and incrementally as a side-product of query processing. As a result, the database table is indexed partially depending on the query workload. This paper faces the problem of adaptive merging for phase change memory (PCM). The most important features of this memory type are limited write endurance and high write latency. As a consequence, adaptive merging should be investigated from the scratch. We solve this problem in two steps. First, we apply several PCM optimization techniques to the traditional adaptive merging approach. We prove that the proposed method (eAM) outperforms a traditional approach by 60%. After that, we invent the framework for adaptive merging (PAM) and propose a new variant of the PCM-optimized index. It further improves the system performance by 20% for databases where search queries interleave with data modifications.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135598941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Coxeter Invariants for Non-negative Unit Forms of Dynkin Type 𝔸r Dynkin型非负单位形式的Coxeter不变量𝔸r

IF 0.8 4区计算机科学

Fundamenta Informaticae Pub Date : 2022-05-05 DOI: 10.3233/fi-222109

Jesús Arturo Jiménez González

引用次数: 5

Preface [to A Mosaic of Computational Topics: from Classical to Novel, Special Issue Dedicated to Jetty Kleijn on the Occasion of Her 65th Birthday] 前言[计算主题的马赛克:从古典到小说，在她65岁生日之际献给Jetty Kleijn的特刊]

IF 0.8 4区计算机科学

Fundamenta Informaticae Pub Date : 2020-01-01 DOI: 10.3233/FI-2020-1945

Beek M Ter, M. Koutny, G. Rozenberg

引用次数: 0

Integrating Petri Nets and Flux Balance Methods in Computational Biology Models : a Methodological and Computational Practice 在计算生物学模型中整合Petri网和通量平衡方法:方法论和计算实践

IF 0.8 4区计算机科学

Fundamenta Informaticae Pub Date : 2019-01-01 DOI: 10.3233/FI-2020-1888

Pernice Simone, Follia Laura, B. Gianfranco, Milanesi Luciano, Sartini Giulia, Totis Niccoló, L. Pietro, Merelli Ivan, Cordero Francesca, Beccuti Marco

引用次数: 8

Neighborhood Systems: Rough Set Approximations and Definability 邻域系统:粗糙集逼近和可定义性

IF 0.8 4区计算机科学

Fundamenta Informaticae Pub Date : 2018-01-01 DOI: 10.3233/FI-2018-1670

Yu-Ru Syau, E. Lin, C. Liau

引用次数: 2

Shelah-Stupp's Iteration and Muchnik's Iteration Shelah-Stupp的迭代和Muchnik的迭代

IF 0.8 4区计算机科学

Fundamenta Informaticae Pub Date : 2018-01-01 DOI: 10.3233/FI-2018-1667

D. Caucal, Teodor Knapik

引用次数: 1

Logic Operation Model of the Complementer Based on Two-domain DNA Strand Displacement 基于双域DNA链位移的互补体逻辑运算模型