A multikey hashing scheme using predicate trees

IF 0.9 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Sigmod Record Pub Date : 1984-06-01 DOI:10.1145/971697.602275

ValduriezPatrick, ViemontYann

引用次数: 0

Abstract

A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address This method is based on a new structure, called predicate tree, th...

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

使用谓词树的多键散列方案

提出了一种适用于动态文件的多键访问新方法，该方法将多个键值转换为一个逻辑地址。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Sigmod Record 工程技术-计算机：软件工程

CiteScore

3.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： SIGMOD investigates the development and application of database technology to support the full range of data management needs. The scope of interests and members is wide with an almost equal mix of people from industryand academia. SIGMOD sponsors an annual conference that is regarded as one of the most important in the field, particularly for practitioners. Areas of Special Interest: Active and temporal data management, data mining and models, database programming languages, databases on the WWW, distributed data management, engineering, federated multi-database and mobile management, query processing & optimization, rapid application development tools, spatial data management, user interfaces.

期刊最新文献

Where do Databases and Digital Forensics meet? A Comprehensive Survey and Taxonomy From Large Language Models to Databases and Back: A Discussion on Research and Education Reminiscences on Influential Papers Proactive Resource Allocation Policy for Microsoft Azure Cognitive Search Kùzu: A Database Management System For "Beyond Relational" Workloads