NDLI: The hyperdyadic index and generalized indexing and query with PIQUE

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

Estimating mutual information on data streams

A compression-based framework for the efficient analysis of business process logs

Top-k entity augmentation using consistent set covering

OpenAlea: scientific workflows combining data analysis and simulation

Top-k representative queries with binary constraints

DrillBeyond: processing multi-result open world SQL queries

Aggregation and multidimensional analysis of big data for large-scale scientific applications: models, issues, analytics, and beyond

Orthogonal mechanism for answering batch queries with differential privacy

Querying RDF data with text annotated graphs

FiND: a real-time filtering by novelty and diversity for publish/subscribe systems

A novel approach for approximate aggregations over arrays

On the internal evaluation of unsupervised outlier detection

Online template matching over a stream of digitized documents

TarMiner: automatic extraction of miRNA targets from literature

Optimizing continuous queries using update propagation with varying granularities

How to quantify the impact of lossy transformations on change detection

The hyperdyadic index and generalized indexing and query with PIQUE

Extending database task schedulers for multi-threaded application code

Relaxation of subgraph queries delivering empty results

Improving performance of similarity measures for uncertain time series using preprocessing techniques

Data mining for isotopic mapping of bioarchaeological finds in a central european alpine passage

Probabilistic aggregate skyline join queries: skylines with aggregate operations over existentially uncertain relations

Distributed top-k query processing on multi-dimensional data with keywords

Vertical partitioning for query processing over raw data

RUBIK: efficient threshold queries on massive time series

Transparent inclusion, utilization, and validation of main memory domain indexes

Privacy-preserving big data publishing

GRAPHITE: an extensible graph traversal framework for relational database management systems

Towards automated prediction of relationships among scientific datasets

RITA: an index-tuning advisor for replicated databases

Compact distance histogram: a novel structure to boost k-nearest neighbor queries

Ontology-assisted keyword search for NeuroML models

SciCSM: novel contrast set mining over scientific datasets using bitmap indices

Efficient iterative processing in the SciDB parallel array engine

GEN: a database interface generator for HPC programs

Batch matching of conjunctive triple patterns over linked data streams in the internet of things

The hyperdyadic index and generalized indexing and query with PIQUE

Content Provider	ACM Digital Library
Author	Tang, Houjun Boyuka, David A. Bansal, Kushal Zou, Xiaocheng Klasky, Scott Samatova, Nagiza F.
Abstract	Many scientists rely on indexing and query to identify trends and anomalies within extreme-scale scientific data. Compressed bitmap indexing (e.g., FastBit) is the go-to indexing method for many scientific datasets and query workloads. Recently, the ALACRITY compressed inverted index was shown as a viable alternative approach. Notably, though FastBit and ALACRITY employ very different data structures (inverted list vs. bitmap) and binning methods (bit-wise vs. decimal-precision), close examination reveals marked similarities in index structure. Motivated by this observation, we ask two questions. First, "Can we generalize FastBit and ALACRITY to an index model encompassing both?" And second, if so, "Can such a generalized framework enable other, new indexing methods?" This paper answers both questions in the affrmative. First, we present PIQUE, a Parallel Indexing and Query Unified Engine, based on formal mathematical decomposition of the indexing process. PIQUE factors out commonalities in indexing, employing algorithmic/data structure "plugins" to mix orthogonal indexing concepts such as FastBit compressed bitmaps with ALACRITY binning, all within one framework. Second, we define the hyperdyadic tree index, distinct from both bitmap and inverted indexes, demonstrating good index compression while maintaining high query performance. We implement the hyperdyadic tree index within PIQUE, reinforcing our unified indexing model. We conduct a performance study of the hyperdyadic tree index vs. WAH compressed bitmaps, both within PIQUE and compared to FastBit, a state-of-the-art bitmap index system. The hyperdyadic tree index shows a 1.14-1.90x storage reduction vs. compressed bitmaps, with comparable or better query performance under most scenarios tested.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781450337090
DOI	10.1145/2791347.2791374
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-06-29
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

Efficient phrase querying with an auxiliary index

Generalized Partial Indexes (1995)

Profit of extending standard relational databases with the Intelligent Cluster Index (ICIx)

Generalized data stream indexing and temporal query processing

Web text retrieval with a P2P query-driven index

Towards indexing functions: answering scalar product queries

SIMP: Efficient XML Structural Index for Multiple Query Processing

Closure-tree: an index structure for graph queries.

Closure-Tree: An Index Structure for Graph Queries

The hyperdyadic index and generalized indexing and query with PIQUE

Similar Documents

Efficient phrase querying with an auxiliary index

Generalized Partial Indexes (1995)

Profit of extending standard relational databases with the Intelligent Cluster Index (ICIx)

Generalized data stream indexing and temporal query processing

Web text retrieval with a P2P query-driven index

Towards indexing functions: answering scalar product queries

SIMP: Efficient XML Structural Index for Multiple Query Processing

Closure-tree: an index structure for graph queries.

Closure-Tree: An Index Structure for Graph Queries

The hyperdyadic index and generalized indexing and query with PIQUE