Scalability analysis of declustering methods for multidimensional range queries

Abstract—Efficient storage and retrieval of multiattribute data sets has become one of the essential requirements for many data-intensive applications. The Cartesian product file has been known as an effective multiattribute file structure for partial-match and best-match queries. Several heuristic methods have been developed to decluster Cartesian product files across multiple disks to obtain high performance for disk accesses. Although the scalability of the declustering methods becomes increasingly important for systems equipped with a large number of disks, no analytic studies have been done so far. In this paper, we derive formulas describing the scalability of two popular declustering methods¦Disk Modulo and Fieldwise Xor¦for range queries, which are the most common type of queries. These formulas disclose the limited scalability of the declustering methods, and this is corroborated by extensive simulation experiments. From the practical point of view, the formulas given in this paper provide a simple measure that can be used to predict the response time of a given range query and to guide the selection of a declustering method under various conditions

Foam: A General-Purpose Cellular Monte Carlo Event Generator

A general purpose, self-adapting, Monte Carlo (MC) event generator (simulator) is described. The high efficiency of the MC, that is small maximum weight or variance of the MC weight is achieved by means of dividing the integration domain into small cells. The cells can be $n$-dimensional simplices, hyperrectangles or Cartesian product of them. The grid of cells, called ``foam'', is produced in the process of the binary split of the cells. The choice of the next cell to be divided and the position/direction of the division hyper-plane is driven by the algorithm which optimizes the ratio of the maximum weight to the average weight or (optionally) the total variance. The algorithm is able to deal, in principle, with an arbitrary pattern of the singularities in the distribution. As any MC generator, it can also be used for the MC integration. With the typical personal computer CPU, the program is able to perform adaptive integration/simulation at relatively small number of dimensions ($\leq 16$). With the continuing progress in the CPU power, this limit will get inevitably shifted to ever higher dimensions. {\tt Foam} is aimed (and already tested) as a component in the MC event generators for the high energy physics experiments. A few simple examples of the related applications are presented. {\tt Foam} is written in fully object-oriented style, in the C++ language. Two other versions with a slightly limited functionality, are available in the Fortran77 language. The source codes are available from http://jadach.home.cern.ch/jadach

Scalability Analysis of Declustering Methods for Cartesian Product Files

Efficient storage and retrieval of multi-attribute datasets has become one of the essential requirements for many data-intensive applications. The Cartesian product file has been known as an effective multi-attribute file structure for partial-match and best-match queries. Several heuristic methods have been developed to decluster Cartesian product files over multiple disks to obtain high performance for disk accesses. Though the scalability of the declustering methods becomes increasingly important for systems equipped with a large number of disks, no analytic studies have been done so far. In this paper we derive formulas describing the scalability of two popular declustering methods Disk Modulo and Fieldwise Xor for range queries, which are the most common type of queries. These formulas disclose the limited scalability of the declustering methods and are corroborated by extensive simulation experiments. From the practical point of view, the formulas given in this paper provide a simple measure which can be used to predict the response time of a given range query and to guide the selection of a declustering method under various conditions. (Also cross-referenced as UMIACS-TR-96-5

Systems Technology Laboratory (STL) compendium of utilities

Multipurpose programs, routines and operating systems are described. Data conversion and character string comparison subroutine are included. Graphics packages, and file maintenance programs are also included

Storage and Querying of Large Persistent Arrays

The scientic and analytical applications today are increasingly becoming data in- tensive. Many such applications deal with data that is multidimensional in nature. Traditionally, relational database systems have been used by many data intensive application, and relational paradigm has proved to be both natural and ecient. However, for multidimensional data, when the number of dimensions becomes large, relational databases are inecient both in terms of storage and query response time. In this thesis, we explore linearised storage, and indexed and skiplist based retrieval on persistent arrays. The application programs are provided with a logical view of multidimensional array. The techniques have been implemented in a home-grown database management system called MuBase

PLOT3D user's manual

PLOT3D is a computer graphics program designed to visualize the grids and solutions of computational fluid dynamics. Seventy-four functions are available. Versions are available for many systems. PLOT3D can handle multiple grids with a million or more grid points, and can produce varieties of model renderings, such as wireframe or flat shaded. Output from PLOT3D can be used in animation programs. The first part of this manual is a tutorial that takes the reader, keystroke by keystroke, through a PLOT3D session. The second part of the manual contains reference chapters, including the helpfile, data file formats, advice on changing PLOT3D, and sample command files

Expressing imaging algorithms using a C++ based image algebra programming environment

Homogeneous Image Algebra is used as the basis for an image processing environment that uses the image, instead of the pixel, as the fundamental unit being manipulated. The object-oriented language C++ is used to implement the environment. Examples of applications are that include filtering, region growing, skeletonization, Fourier Transforms and Hadamard transforms are presented. This thesis concludes that C++ does have several features which are of great benefit in implementing image processing algorithms

Query Optimization Techniques for OLAP Applications: An ORACLE versus MS-SQL Server Comparative Study

Query optimization in OLAP applications is a novel problem. A lot of research was introduced in the area of optimizing query performance, however great deal of research focused on OLTP applications rather than OLAP. In order to reach the output results OLAP queries extensively asks the database, inefficient processing of those queries will have its negative impact on the performance and may make the results useless. Techniques for optimizing queries include memory caching, indexing, hardware solutions, and physical database storage. Oracle and MS SQL Server both offer OLAP optimization techniques, the paper will review both packages’ approaches and then proposes a query optimization strategy for OLAP applications. The proposed strategy is based on use of the following four ingredients: 1- intermediate queries; 2- indexes both BTrees and Bitmaps; 3- memory cache (for the syntax of the query) and secondary storage cache (for the result data set); and 4- the physical database storage (i.e. binary storage model) accompanied by its hardware solution

Large-scale Evolution of Seconds-long Relativistic Jets from Black Hole-Neutron Star Mergers

We present the first numerical simulations that track the evolution of a black hole-neutron star (BH-NS) merger from pre-merger to $r\gtrsim10^{11}\,{\rm cm}$. The disk that forms after a merger of mass ratio $q=2$ ejects massive disk winds ($3-5\times10^{-2}\,M_\odot$). We introduce various post-merger magnetic configurations, and find that initial poloidal fields lead to jet launching shortly after the merger. The jet maintains a constant power due to the constancy of the large-scale BH magnetic flux, until the disk becomes magnetically arrested (MAD), where the jet power falls off as $L_j\sim t^{-2}$. All jets inevitably exhibit either excessive luminosity due to rapid MAD activation when accretion rate is high, or excessive duration due to delayed MAD activation, compared to typical short gamma-ray burst (sGRBs). This provides a natural explanation to long sGRBs such as GRB 211211A, but also raises a fundamental challenge to our understanding of jet formation in binary mergers. One possible implication being the necessity of higher binary mass ratios or moderate BH spins to launch typical sGRB jets. For post-merger disks with a toroidal magnetic field, dynamo processes delay jet launching such that the jets break out of the disk winds after several seconds. We show for the first time that sGRB jets with initial magnetization $\sigma_0>100$ retain significant magnetization ($\sigma\gg1$) at $r>10^{10}\,{\rm cm}$, emphasizing the importance of magnetic processes in the prompt emission. The jet-wind interaction leads to a power-law angular energy distribution by inflating an energetic cocoon, whose emission is studied in a companion paper.Comment: For movies of the simulations, see https://oregottlieb.com/bhns.htm