NDLI: Multiattribute indexing with m-Q-trees

Content Provider	IEEE Xplore Digital Library
Author	Polo, A. Mansanzo, J.C. Salas, M. Sanchez, M. Jurado, E. Barrena, M. Hernandez, J. Martinez, J.M.
Copyright Year	1998
Description	Author affiliation: Comput. Sci. Dept., Univ. de Extremadura, Badajoz, Spain (Polo, A.)
Abstract	A wide class of multidimensional indexes employs a recursive partitioning of the data space as the kd-tree does. In this paper we present the m-Q-tree as a multidimensional data structure that can achieve the maximum degree of 2/sup m/ children in every node (where m is the number of index attributes) and a maximum of only one underflow page per node. We describe the m-Q-tree, and give searching and inserting algorithms. In order to develop a solution for building the m-Q-tree we define and use a conceptual tool, called prefix graph, which permits us to manage the regions associated to all sons of every node. The proposed algorithm is of order O(m). Finally, we present the results of a series of tests which indicate that the structure preforms well. m-Q-tree gives a general technique for declustering data in a parallel database. We propose m-Q-tree as a new general access method which permits the exploitation of the potential parallelism of all relational operations, in addition to favour the execution of complex queries, including different kinds of conditions over several attributes fro one or more relations.
Starting Page	94
Ending Page	101
File Size	785062
Page Count	8
File Format	PDF
ISBN	0818683325
ISSN	10666192
DOI	10.1109/EMPDP.1998.647185
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-01-23
Publisher Place	Spain
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Indexing Multidimensional systems Relational databases Data structures Spatial databases Transaction databases Information retrieval Computer science Operating systems Buildings
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

Retrieval by shape using multidimensional indexing structures

Incorporating updates in domain indexes: experiences with Oracle spatial R-trees

Indexing non-uniform spatial data

The SBS: an efficient index structure for spatial database applications

Indexing high-dimensional data for content-based retrieval in large databases

A study on spatial attribute data mining based on rough set

Concurrency control in B-trees with batch updates

Exploring spatial datasets with histograms

The TP-Index: a dynamic and efficient indexing mechanism for temporal databases

Multiattribute indexing with m-Q-trees

Similar Documents

Retrieval by shape using multidimensional indexing structures

Incorporating updates in domain indexes: experiences with Oracle spatial R-trees

Indexing non-uniform spatial data

The SBS: an efficient index structure for spatial database applications

Indexing high-dimensional data for content-based retrieval in large databases

A study on spatial attribute data mining based on rough set

Concurrency control in B-trees with batch updates

Exploring spatial datasets with histograms

The TP-Index: a dynamic and efficient indexing mechanism for temporal databases

Multiattribute indexing with m-Q-trees