NDLI: Optimizing multidimensional index trees for main memory access

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

Efficient computation of Iceberg cubes with complex measures

On computing correlated aggregates over continual data streams

Iceberg-cube computation with PC clusters

Outlier detection for high dimensional data

Bit-sliced index arithmetic

Space-efficient online computation of quantile summaries

Probe, count, and classify: categorizing hidden web databases

Data bubbles: quality preserving performance boosting for hierarchical clustering

Mining needle in a haystack: classifying rare classes via two-phase rule induction

Efficient evaluation of XML middle-ware queries

Filtering algorithms and implementation for very fast publish/subscribe systems

Adaptable query optimization and evaluation in temporal middleware

Optimizing multidimensional index trees for main memory access

Locally adaptive dimensionality reduction for indexing large time series databases

Main-memory index structures with fixed-size partial keys

Automatic segmentation of text into structured records

Efficient and effective metasearch for text databases incorporating linkages among documents

Independence is good: dependency-based histogram synopses for high-dimensional data

STHoles: a multidimensional workload-aware histogram

Global optimization of histograms

Improving index performance through prefetching

Efficient and tumble similar set retrieval

PREFER: a system for the efficient execution of multi-parametric ranked queries

Query optimization in compressed database systems

SPARTAN: a model-based semantic compression system for massive data tables

A robust, optimization-based approach for approximate answering of aggregate queries

Materialized view selection and maintenance using multi-query optimization

Generating efficient plans for queries using views

Optimizing queries using materialized views: a practical, scalable solution

Dynamic buffer allocation in video-on-demand systems

Adaptive precision setting for cached approximate values

Proxy-server architectures for OLAP

Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data

Modeling high-dimensional index structures using sampling

Progressive approximate aggregate queries with a multi-resolution tree structure

On supporting containment queries in relational database management systems

Monitoring XML data on the Web

Applying the golden rule of sampling for query estimation

Selectivity estimation using probabilistic models

Communication-efficient distributed mining of association rules

Data-driven understanding and refinement of schema mappings

Minimization of tree pattern queries

Reconciling schemas of disparate data sources: a machine-learning approach

StorHouse metanoia - new applications for database, storage & data warehousing

Enabling dynamic content caching for database-driven web sites

The network is the database: data management for highly distributed systems

Content integration for e-business

Catalog management in websphere commerce suite

Experiences in mining aviation safety data

The nimble integration engine

Data management: lasting impact on wild, wild, web

Orthogonal optimization of subqueries and aggregation

Exploiting constraint-like data characterizations in query optimization

Fast-Start: quick fault recovery in oracle

Dissemination of dynamic data

COSIMA- your smart, speaking E-salesperson

REVIEW: a real-time virtual walkthrough system

Kweelt: more than just “yet another framework to query XML!”

VQBD: exploring semistructured data

OminiSearch: a method for searching dynamic content on the Web

Securing XML documents: the author-X project demonstration

Sangam - a solution to support multiple data models, their mappings and maintenance

Clio: a semi-automatic tool for schema mapping

Materialized view and index selection tool for Microsoft SQL server 2000

The prototype of the DARE system

Monitoring business processes through event correlation based on dependency model

Fault-tolerant, load-balancing queries in telegraph

Snowball: a prototype system for extracting relations from large text collections

PBIR - perception-based image retrieval

Spatial data management for computer aided design

RETINA: a real-time traffic navigation system

Dynamic content acceleration: a caching solution to enable scalable dynamic Web page generation

Lots o'Ticks: real time high performance time series queries on billions of trades and quotes

DNA-miner: a system prototype for mining DNA sequences

DyDa: data warehouse maintenance in fully concurrent environments

XML data management (panel session): go native or spruce up relational systems?

Will database researchers have any role in data security? (panel session)

Application servers (panel session): born-again TP monitors for the Web

Online query processing: a tutorial

Time series similarity measures and time series indexing (abstract only)

Semantic B2B integration

Models and languages for describing and discovering E-services

Standard for multimedia databases

Optimizing multidimensional index trees for main memory access

Content Provider	ACM Digital Library
Author	Kwon, Keunjoo Kim, Kihong Cha, Sang K.
Abstract	Recent studies have shown that cache-conscious indexes such as the CSB+-tree outperform conventional main memory indexes such as the T-tree. The key idea of these cache-conscious indexes is to eliminate most of child pointers from a node to increase the fanout of the tree. When the node size is chosen in the order of the cache block size, this pointer elimination effectively reduces the tree height, and thus improves the cache behavior of the index. However, the pointer elimination cannot be directly applied to multidimensional index structures such as the R-tree, where the size of a key, typically, an MBR (minimum bounding rectangle), is much larger than that of a pointer. Simple elimination of four-byte pointers does not help much to pack more entries in a node.This paper proposes a cache-conscious version of the R-tree called the CR-tree. To pack more entries in a node, the CR-tree compresses MBR keys, which occupy almost 80% of index data in the two-dimensional case. It first represents the coordinates of an MBR key relatively to the lower left corner of its parent MBR to eliminate the leading O's from the relative coordinate representation. Then, it quantizes the relative coordinates with a fixed number of bits to further cut off the trailing less significant bits. Consequently, the CR-tree becomes significantly wider and smaller than the ordinary R-tree. Our experimental and analytical study shows that the two-dimensional CR-tree performs search up to 2.5 times faster than the ordinary R-tree while maintaining similar update performance and consuming about 60% less memory space.
Starting Page	139
Ending Page	150
Page Count	12
File Format	PDF
ISBN	1581133324
DOI	10.1145/375663.375679
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-05-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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