Performance comparison of point and spatial access methods

In the past few years a large number of multidimensional point access methods, also called multiattribute index structures, has been suggested, all of them claiming good performance. Since no performance comparison of these structures under arbitrary (strongly correlated nonuniform, short "ugly") data distributions and under various types of queries has been performed, database researchers and designers were hesitant to use any of these new point access methods. As shown in a recent paper, such point access methods are not only important in traditional database applications. In new applications such as CAD/CIM and geographic or environmental information systems, access methods for spatial objects are needed. As recently shown such access methods are based on point access methods in terms of functionality and performance. Our performance comparison naturally consists of two parts. In part I we w i l l compare multidimensional point access methods, whereas in part I I spatial access methods for rectangles will be compared. In part I we present a survey and classification of existing point access methods. Then we carefully select the following four methods for implementation and performance comparison under seven different data files (distributions) and various types of queries: the 2-level grid file, the BANG file, the hB-tree and a new scheme, called the BUDDY hash tree. We were surprised to see one method to be the clear winner which was the BUDDY hash tree. It exhibits an at least 20 % better average performance than its competitors and is robust under ugly data and queries. In part I I we compare spatial access methods for rectangles. After presenting a survey and classification of existing spatial access methods we carefully selected the following four methods for implementation and performance comparison under six different data files (distributions) and various 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 a first step towards a standardized testbed or benchmark. We offer our data and query files to each designer of a new point or spatial access method such that he can run his implementation in our testbed

A Report on Mexican Multidimensional Poverty Measurement

This report addresses the challenges arising from a change in Mexico’s official poverty methodology from an income-only basis to a multidimensional basis that includes education, access to health services, access to social security, shelter characteristics, access to basic services, access to food, and level of social cohesion. The concept of poverty underlying this report is drawn from Amartya Sen’s capability approach. The specific multidimensional measurement framework used is that of Alkire and Foster (2007). Special emphasis is placed on the measure’s population decomposability and dimensional decomposability. The new identification and aggregation methods are then applied to 2005 data provided by CONEVAL to illustrate the feasibility of the methodology and the kinds of results that one might obtain.

Locality of Corner Transformation for Multidimensional Spatial Access Methods

AbstractThe geometric structural complexity of spatial objects does not render an intuitive distance metric on the data space that measures spatial proximity. However, such a metric provides a formal basis for analytical work in transformation-based multidimensional spatial access methods, including locality preservation of the underlying transformation and distance-based spatial queries. We study the Hausdorff distance metric on the space of multidimensional polytopes, and prove a tight relationship between the metric on the original space of k-dimensional hyperrectangles and the standard p-normed metric on the transform space of 2k-dimensional points under the corner transformation, which justifies the effectiveness of the transformation-based technique in preserving spatial locality

Perspects in astrophysical databases

Astrophysics has become a domain extremely rich of scientific data. Data mining tools are needed for information extraction from such large datasets. This asks for an approach to data management emphasizing the efficiency and simplicity of data access; efficiency is obtained using multidimensional access methods and simplicity is achieved by properly handling metadata. Moreover, clustering and classification techniques on large datasets pose additional requirements in terms of computation and memory scalability and interpretability of results. In this study we review some possible solutions

Partitioned Blockmap Indexes for Multidimensional Data Access

Given recent increases in the size of main memory in modern machines, it is now common to to store large data sets in RAM for faster processing. Multidimensional access methods aim to provide efficient access to large data sets when queries apply predicates to some of the data dimensions. We examine multidimensional access methods in the context of an in-memory column store tuned for on-line analytical processing or scientific data analysis. We propose a multidimensional data structure that contains a novel combination of a grid array and several bitmaps. The base data is clustered in an order matching that of the index structure. The bitmaps contain one bit per block of data, motivating the term "blockmap." The proposed data structures are compact, typically taking less than one bit of space per row of data. Partition boundaries can be chosen in a way that reflects both the query workload and the data distribution, and boundaries are not required to evenly divide the data if there is a bias in the query distribution. We examine the theoretical performance of the data structure and experimentally measure its performance on three modern CPUs and one GPU processor. We demonstrate that efficient multidimensional access can be achieved with minimal space overhead

Data Management and Mining in Astrophysical Databases

We analyse the issues involved in the management and mining of astrophysical data. The traditional approach to data management in the astrophysical field is not able to keep up with the increasing size of the data gathered by modern detectors. An essential role in the astrophysical research will be assumed by automatic tools for information extraction from large datasets, i.e. data mining techniques, such as clustering and classification algorithms. This asks for an approach to data management based on data warehousing, emphasizing the efficiency and simplicity of data access; efficiency is obtained using multidimensional access methods and simplicity is achieved by properly handling metadata. Clustering and classification techniques, on large datasets, pose additional requirements: computational and memory scalability with respect to the data size, interpretability and objectivity of clustering or classification results. In this study we address some possible solutions.Comment: 10 pages, Late

New directions in the analysis of inequality and poverty

Over the last four decades, academic and wider public interest in inequality and poverty has grown substantially. In this paper we address the question: what have been the major new directions in the analysis of inequality and poverty over the last thirty to forty years? We draw attention to developments under seven headings: changes in the extent of inequality and poverty, changes in the policy environment, increased scrutiny of the concepts of ‘poverty’ and inequality’ and the rise of multidimensional approaches, the use of longitudinal perspectives, an increase in availability of and access to data, developments in analytical methods of measurement, and developments in modelling

SCMA with Low Complexity Symmetric Codebook Design for Visible Light Communication

Sparse code multiple access (SCMA) is attracting significant research interests currently, which is considered as a promising multiple access technique for 5G systems. It serves as a good candidate for the future communication network with massive nodes due to its capability of handling user overloading. Introducing SCMA to visible light communication (VLC) can provide another opportunity on design of transmission protocols for the communication network with massive nodes due to the limited communication range of VLC, which reduces the interference intensity. However, when applying SCMA in VLC systems, we need to modify the SCMA codebook to accommodate the real and positive signal requirement for VLC.We apply multidimensional constellation design methods to SCMA codebook. To reduce the design complexity, we also propose a symmetric codebook design. For all the proposed design approaches, the minimum Euclidean distance aims to be maximized. Our symmetric codebook design can reduce design and detection complexity simultaneously. Simulation results show that our design implies fast convergence with respect to the number of iterations, and outperforms the design that simply modifies the existing approaches to VLC signal requirements

New Directions in the Analysis of Inequality and Poverty

Over the last four decades, academic and wider public interest in inequality and poverty has grown substantially. In this paper we address the question: what have been the major new directions in the analysis of inequality and poverty over the last thirty to forty years? We draw attention to developments under seven headings: changes in the extent of inequality and poverty, changes in the policy environment, increased scrutiny of the concepts of ‘poverty’ and inequality’ and the rise of multidimensional approaches, the use of longitudinal perspectives, an increase in availability of and access to data, developments in analytical methods of measurement, and developments in modelling.inequality, poverty, distribution of income