NDLI: A heuristic approach to attribute partitioning

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

Performance analysis of a relational data base management system

Multi-table search for B-tree files

FQL: a functional query language

Performance analysis of three related assignment problems

An optimality theory of concurrency control for databases

Synthesizing independent database schemas

Extending the data base relational model to capture more meaning

Design of relational views over network schemas

Query execution in DIRECT

Compact B-trees

The functional data model and the data language DAPLEX

A heuristic approach to attribute partitioning

The complexity of testing predicate locks

Testing implications of data dependencies

Null values in data base management a denotational semantics approach

Data model integration using the structural model

Access path selection in a relational database management system

The data management facilities of PLAIN

Evaluation of transmission requirements in distributed database access

Queueing network models for concurrent transaction processing in a database system

Normal forms and relational database operators

Improving semantic specification in a relational database

Data abstraction, views and updates in RIGEL

Cost and performance analysis of semantic integrity validation methods

A heuristic approach to attribute partitioning

Content Provider	ACM Digital Library
Author	Hammer, Michael Niamir, Bahram
Abstract	One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into separately stored subfiles. By storing together those attributes that are frequently requested together by transactions, and by separating those that are not, attribute partitioning can reduce the number of pages that are transferred from secondary storage to primary memory in the processing of a transaction.The goal of this work is to design mechanisms that can automatically select a near-optimal attribute partition of a file's attributes, based on the usage pattern of the file and on the characteristics of the data in the file. The approach taken to this problem is based on the use of an accurate partition evaluator and of a heuristic that guides a search through the large space of possible partitions. The heuristics propose a small set of promising partitions to submit for detailed analysis. The evaluator assigns a figure of merit to any proposed partition that reflects the cost that would be incurred in processing the transactions in the usage pattern if the file were partitioned in the proposed way.We have implemented an evaluator for a particular model database system and have developed a heuristic search technique. A series of experiments has demonstrated the accuracy and efficiency of this heuristic.
Starting Page	93
Ending Page	101
Page Count	9
File Format	PDF
ISBN	089791001X
DOI	10.1145/582095.582110
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1979-05-30
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

A Rough Set Approach in Choosing Partitioning Attributes (2000)

A Rough Set-Based Heuristic Algorithm for Attribute Reduction

An Algorithm for Attribute Reduction Based on Distance of Partitions

A dynamic attribute reduction algorithm based on compound attribute measure

A logic approach for reducing the computational complexity of the attribute reduction problem

A heuristic method to attribute reduction for concept lattice

A user-centric dynamic cluster partitioning approach for HPC service optimization

1+N Protection in Polynomial Time: A Heuristic Approach

Partitioning networks into cliques : a randomized heuristic approach

A heuristic approach to attribute partitioning

Similar Documents

A Rough Set Approach in Choosing Partitioning Attributes (2000)

A Rough Set-Based Heuristic Algorithm for Attribute Reduction

An Algorithm for Attribute Reduction Based on Distance of Partitions

A dynamic attribute reduction algorithm based on compound attribute measure

A logic approach for reducing the computational complexity of the attribute reduction problem

A heuristic method to attribute reduction for concept lattice

A user-centric dynamic cluster partitioning approach for HPC service optimization

1+N Protection in Polynomial Time: A Heuristic Approach

Partitioning networks into cliques : a randomized heuristic approach

A heuristic approach to attribute partitioning