NDLI: Clustered multiattribute hash files

Please wait, while we are loading the content...

The alternating fixpoint of logic programs with negation

Every logic program has a natural stratification and an iterated least fixed point model

A procedural semantics for well founded negation in logic programs

Logic programming as constructivism: a formalization and its application to databases

Complexity of query processing in databases with OR-objects

A sound and complete query evaluation algorithm for relational databases with disjunctive information

Horn tables-an efficient tool for handling incomplete information in databases

Invited talk: automata theory for database theoreticians

Declarative expression of deductive database updates

Updating databases in the weak instance model

Attribute agreement

Can constant-time-maintainability be more practical?

Practical algorithms for finding prime attributes and testing normal forms

A decision procedure for conjunctive query disjointness

Bottom-up beats top-down for datalog

On the power of Alexander templates

Safety of datalog queries over infinite databases

Proof-tree transformation theorems and their applications

Linearising nonlinear recursions in polynomial time

Inference of monotonicity constraints in datalog programs

Why a single parallelization strategy is not enough in knowledge bases

Invited talk: modular architectures for distributed and databases systems

Clustered multiattribute hash files

Utilization of B-trees with inserts, deletes and modifies

Fractals for secondary key retrieval

Declustering using error correcting codes

The impact of recovery on concurrency control

Concurrency control of nested transactions accessing B-trees

Hypothetical datalog negation and linear recursion

Inductive pebble games and the expressive power of datalog

On the first-order expressibility of recursive queries

Expressibility of bounded-arity fixed-point query hierarchies

Relational database behavior: utilizing relational discrete event systems and models

Untyped sets, invention, and computable queries

Modeling complex structures in object-oriented logic programming

C-logic of complex objects

A logic for object-oriented logic programming

Type systems for querying class hierarchies with non-strict inheritance

Clustered multiattribute hash files

Content Provider	ACM Digital Library
Author	Rotem, D.
Abstract	Access methods for multidimensional data have attracted much research interest in recent years. In general, the data structures proposed for this problem partition the database into a set of disk pages (buckets). Access to the buckets is provided by searching a directory of some type such as a tree directory or inverted index or by computation of a multiattribute hash function. Examples of the first approach are Multidimensional B-trees[Sch82], K-D-B trees[Rob81] (see also [Sam84] for a survey of these methods) whereas multiattribute hashing methods are described for example in [Rot74],[Aho79],[Riv76] and [Ram83]. In addition, there are also hybrid methods which combine hashing with a directory of some type [Ore84],[Nie84], [Fag79].In all the work mentioned above, the performance is measured in terms of the number of disk accesses made to retrieve the answer without distinguishing whether these are sequential or random. We argue that performance measurements must consider this factor in order to be realistic, especially in the single user environment. Some evidence to support this claim is given in [Sal88, pg. 22] with the IBM 3380 disk drive as an example. For this type of disk, a comparison between accessing m blocks randomly and accessing a contiguous cluster of m blocks is made. The results show that for m = 10, the random access is slower by a factor of about 8 than the clustered one whereas for m = 100 it is slower by a factor of 25.Another motivation for this work are optical disks. In this case, there is a big advantage in clustering since the access mechanism on many of these drives is equipped with an adjustable mirror which allows slight deflections of the laser beam. This means that it may be possible to read a complete cluster from a sequence of adjacent tracks beneath the head with a single random seek [Chri88].Our work is inspired by an interesting recent paper [Fal86] which proposes to organize the physical layout of a multiattribute hash file by encoding record signatures using gray code rather than simple binary code. In this way neighboring buckets contain records which differ on a single bit in their signatures. It is then proved that the records which form the answer to a partial match query will tend to be contained in a smaller number of clusters as compared with the binary arrangement. It is also shown that this idea is applicable to many other multiattribute hashing schemes with a small amount of overhead. In addition, it can improve access time to directories of grid type files, extendible hashing and file methods which employ the z-ordering [Ore84].
Starting Page	225
Ending Page	234
Page Count	10
File Format	PDF
ISBN	0897913086
DOI	10.1145/73721.73744
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-03-29
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Random sampling from hash files

Performance of hash files in a microcomputer based parallel file system

Generation and search of clustered files

Random Sampling from Hash Files

The rapid algorithm of the files comparison with the hash functions usage

JARS: Join-Aware Distributed RDF Storage

Decentralised clustered and hash based intrusion detection system for wireless sensor networks

Forensically Classifying Files Using HSOM Algorithms

Random sampling from hash files

Clustered multiattribute hash files

Similar Documents

Random sampling from hash files

Performance of hash files in a microcomputer based parallel file system

Generation and search of clustered files

Random Sampling from Hash Files

The rapid algorithm of the files comparison with the hash functions usage

JARS: Join-Aware Distributed RDF Storage

Decentralised clustered and hash based intrusion detection system for wireless sensor networks

Forensically Classifying Files Using HSOM Algorithms

Random sampling from hash files

Clustered multiattribute hash files