... Disc Modulo (GDM) allocation method for multiple key hashing (MKH) files on multi-disc systems. A very important performance ...
Tópico(s): Data Management and Algorithms
1987 - Oxford University Press | The Computer Journal
Chia‐Chen Chang, Cheng–Ying Chen,
... introduce the concept of k-ary multiple key hashing (MKH) files and the disk modulo (DM) allocation method. It ...
Tópico(s): Advanced Data Storage Technologies
1991 - Elsevier BV | Information Sciences
Je-Hao Wang, Tak-Sun Yuen, Di Du,
... for locating and organizing the records. A linear hashing file does not employ any directory and its primary ... contiguous, therefore the data area of a linear hashing file corresponds closely to the disk space on a ...
Tópico(s): Data Management and Algorithms
1987 - IEEE Computer Society | IEEE Transactions on Software Engineering
Cheng–Ying Chen, Chin‐Chen Chang, R.C.T Lee,
... an important dynamic file, namely the multiple key hashing (MKH) file and the extendible hashing (EH) file, for answering ORQs. Based upon these performance formulas, ...
Tópico(s): Algorithms and Data Compression
1993 - Elsevier BV | Information Systems
Jin-Deog Kim, Sang-Ho Moon, Jin-Oh Choi,
... paper proposes a spatial index called MHF(Multilevel Hashing File) for the mobile map service. The MHF has a simple structure for storage utilization and uses a hashing technique for search efficiency. This paper also designs ...
Tópico(s): Advanced Image and Video Retrieval Techniques
2005 - Springer Science+Business Media | Lecture notes in computer science
Chia‐Chen Chang, H. F. Lin, C. Y. Chen,
Multiple key hashing files have been shown to exhibit attractive properties for partial match retrieval. The Disc Modulo (DM) allocation method has ... to facilitate partial match retrieval for multiple key hashing files on multiple discs. In this paper, it is ... method is optimal for k-ary multiple key hashing files under the condition that k ≡ (0 or 1 ...
Tópico(s): Cryptography and Data Security
1992 - Oxford University Press | The Computer Journal
Simson Garfinkel, Michael McCarrin,
... than the hashes of entire files. Unlike whole-file hashing, hash-based carving can identify files that are fragmented, files that are incomplete, or ...
Tópico(s): Digital Media Forensic Detection
2015 - Elsevier BV | Digital Investigation
... compared to the extendible hashing and the extendible hashing tree schemes. The simulation results reveal that the proposed scheme is superior than the other two with respect to directory space utilization, especially for files with nonuniform record distribution. This scheme can be ...
Tópico(s): Peer-to-Peer Network Technologies
1991 - IEEE Computer Society | IEEE Transactions on Knowledge and Data Engineering
Anuj Kumar Yadav, Ritika Ritika, Mada Garg,
... file into blocks, encoding the file, generation of hashing on the file and application of signature on the data.The ...
Tópico(s): Cloud Data Security Solutions
2019 - Lavoisier publishing | Ingénierie des systèmes d information
... for multi‐attribute files based upon multi‐key hashing functions and haphazard files respectively. Theoretical results show that the performance of multi‐attribute files based upon multiple key hashing functions is always superior to that of haphazard files.
Tópico(s): Advanced Image and Video Retrieval Techniques
1987 - Taylor & Francis | Journal of the Chinese Institute of Engineers
Linear hashing is a file structure for dynamic files. In this paper, a new, simple method for handling overflow records in connection with linear hashing is proposed. The method is based on linear ... studied by simulation. The algorithms for the basic file operations are very simple, and the overall performance is competitive with that of other variants of linear hashing.
Tópico(s): Caching and Content Delivery
1985 - Association for Computing Machinery | ACM Transactions on Database Systems
... metadata locality using consistent hashing and locality-preserving hashing, keeps replicated metadata for excellent reliability, and dynamically distributes metadata among the NameNodes to keep load balancing. NameNode is a centralized heart of the Hadoop. Keeping the directory tree of all files, failure of which causes the single point of ...
Tópico(s): Peer-to-Peer Network Technologies
2016 - Springer Science+Business Media | Frontiers of Information Technology & Electronic Engineering
Joel Young, Kristina Foster, Simson Garfinkel, Kevin D. Fairbanks,
Using an alternative approach to traditional file hashing, digital forensic investigators can hash individually sampled subject drives on sector boundaries and then check these hashes against a prebuilt database, making it possible to process raw media without reference to the underlying file system.
Tópico(s): Advanced Steganography and Watermarking Techniques
2012 - IEEE Computer Society | Computer
Produção Nacional
Revisado por pares
Marcus Botacin, Vitor Hugo Galhardo Moia, Fabrício Ceschin, Marco Aurélio Amaral Henriques, André Grégio,
... g., instructions), leads to better classification results than hashing the entire binary file.
Tópico(s): Network Security and Intrusion Detection
2021 - Elsevier BV | Forensic Science International Digital Investigation
Christos Faloutsos, Stavros Christodoulakis,
... a framework that includes primary key hashing, multiattribute hashing, and signature files. Our effort is to find the optimal signature ...
Tópico(s): Network Packet Processing and Optimization
1987 - Association for Computing Machinery | ACM Transactions on Database Systems
Tak-Sun Yuen, David Hung-Chang Du,
A hashing-based dynamic file structure is introduced for partial match retrieval using overflow bucket sharing. The sharing of overflow buckets is ...
Tópico(s): Advanced Data Storage Technologies
1986 - IEEE Computer Society | IEEE Transactions on Software Engineering
Katarzyna Koptyra, Marek R. Ogiela,
... and resistance to forgery. This is achieved by hashing the whole file with embedded data, so the image cannot be ...
Tópico(s): Cloud Data Security Solutions
2020 - Multidisciplinary Digital Publishing Institute | Sensors
Keith Lawrence Kelley, Marek Rusinkiewicz,
The design and implementation of a multikey, extensible hashing file addressing scheme and its application as an access ...
Tópico(s): Caching and Content Delivery
1988 - IEEE Computer Society | IEEE Software
Kotagiri Ramamohanarao, John Shepherd, Ron Sacks‐Davis,
The average cost for answering partial-match queries can be dramatically reduced by storing multiple copies of the data, each with a different clustering. We analyse the cost benefits (in terms of page accesses) of this arrangement and present heuristic algorithms for determining a near-minimal-cost file organisation for a given probability distribution of queries. We also show how constraining the range of values for specific attributes affects the usefulness of maintaining multiple copies.
Tópico(s): Advanced Image and Video Retrieval Techniques
1990 - Springer Science+Business Media | BIT Numerical Mathematics
Anitta Patience Namanya, Irfan Awan, Jules Pagna Disso, Muhammad Younas,
... that existing security systems are bypassed by malicious files. Similarity hashing has been adopted for sample triaging in malware ... used in malware analysis for portable executable (PE) files. Although each hashing technique produces interesting results, when applied independently, they ...
Tópico(s): Advanced Steganography and Watermarking Techniques
2019 - Elsevier BV | Future Generation Computer Systems
... while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.
Tópico(s): Caching and Content Delivery
1988 - Association for Computing Machinery | ACM Computing Surveys
Di Du, S. Ghanta, K. Maly, S. M. Sharrock,
... file structure that combines and extends multikey extendible hashing and signature files to create a document-retrieval system that is ...
Tópico(s): Advanced Data Storage Technologies
1989 - IEEE Computer Society | IEEE Transactions on Knowledge and Data Engineering
... In addition to the HG-tree, the signature file and hashing technique are also employed to index keywords and ... combines and extends the HG-tree, the signature file, and the hashing scheme to support complex similarity queries. We also ...
Tópico(s): Data Management and Algorithms
1999 - Elsevier BV | Journal of Visual Communication and Image Representation
article A multidimensional digital hashing scheme for files with composite keys Share on Author: Ekow J. Otoo School of Computer Science, Carleton University, Ottawa, Canada School of Computer ...
Tópico(s): Advanced Image and Video Retrieval Techniques
1985 - Association for Computing Machinery | ACM SIGMOD Record
Ian Shiel, Stephen O’Shaughnessy,
... produce a method to overcome the limitations of file-level similarity hashing, such as poor performance against obfuscated malware. Section- ... Portable Executable (PE) files and that section-level hashing and comparison produces considerably better results than at file-level.
Tópico(s): Network Security and Intrusion Detection
2019 - Elsevier BV | Digital Investigation
Hsiao Yeong-Shiou, Alan L. Tharp,
Adaptive hashing is a new file processing scheme which combines the organization of a B+-Tree with the operational algorithms of order-preserving linear hashing, and in so doing, it fully utilizes the advantages of both. Its performance, which can be controlled by a single parameter, is stable under all circumstances. Its storage utilization is nearly 80% at any time under any circumstances. No other file organization or algorithms are known which attain such ...
Tópico(s): Advanced Data Storage Technologies
1988 - Elsevier BV | Information Systems
Frank Olken, Doron Rotem, Ping Xu,
... hash files with separate overflow chains. The dynamic hashing methods considered are Linear Hash files [Lit80] and Extendible Hash files [FNPS79]. We give ... of the cost of successfully searching a hash file and show how to exploit features of the dynamic hashing methods to improve sampling efficiency.
Tópico(s): Advanced Image and Video Retrieval Techniques
1990 - Association for Computing Machinery | ACM SIGMOD Record
M. Ramakrishna, Per-Åke Larson,
... overflows. We propose and analyze a composite perfect hashing scheme for large external files. The scheme guarantees retrieval of any record in ...
Tópico(s): Caching and Content Delivery
1989 - Association for Computing Machinery | ACM Transactions on Database Systems
... generalized approach for designing a class of dynamic hashing schemes which require no index and have the growth of a file at a rate of (n+1)/n per ... n is the number of pages of the file, as compared to a rate of 2 in linear hashing. Based on this generalized approach, we derive a ...
Tópico(s): Algorithms and Data Compression
1997 - IEEE Computer Society | IEEE Transactions on Knowledge and Data Engineering
Hans‐Peter Kriegel, Michael Schiwietz, Ralf Schneider, Bernhard Seeger,
... types of queries: the R-tree, the BANG file, PLOP hashing and the BUDDY hash tree. The result presented two winners: the BANG file and the BUDDY hash tree. This comparison is ...
Tópico(s): Geographic Information Systems Studies
1990 - Springer Science+Business Media | Lecture notes in computer science