Scalable preference queries for high-dimensional data using map-reduce

No abstract is available for this paper.

• Publication year

  2015

• Venue

  2015 IEEE International Conference on Big Data (Big Data)

• Publication date

  2015-10-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/BigData.2015.7364013
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Hybrid query optimization for hard-to-compress bit-vectors

  2015influential reference
• Searching for exotic particles in high-energy physics with deep learning

  2014cited by this paper
• Rank Join Queries in NoSQL Databases

  2014cited by this paper
• Better bitmap performance with Roaring bitmaps

  2014cited by this paper
• A tunable compression framework for bitmap indices

  2014cited by this paper
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XIV

  2014cited by this paper
• Slicing the Dimensionality: Top-k Query Processing for High-Dimensional Spaces

  2014influential reference
• A survey of large-scale analytical query processing in MapReduce

  2013cited by this paper
• Reordering rows for better compression: Beyond the lexicographic order

  2012cited by this paper
• Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing

  2012cited by this paper
• RanKloud: a scalable ranked query processing framework on hadoop

  2011cited by this paper
• A memory efficient reachability data structure through bit vector compression

  2011cited by this paper
• Spark: Cluster Computing with Working Sets

  2010cited by this paper
• Hadoop: The Definitive Guide

  2009cited by this paper
• Hive - A Warehousing Solution Over a Map-Reduce Framework

  2009cited by this paper
• Answering preference queries with bit-sliced index arithmetic

  2008cited by this paper
• MapReduce: simplified data processing on large clusters

  2008influential reference
• KLEE: A Framework for Distributed Top-k Query Algorithms

  2005cited by this paper
• Efficient Processing of Distributed Top-k Queries

  2005cited by this paper
• Efficient top-K query calculation in distributed networks

  2004cited by this paper
• Optimized Query Execution in Large Search Engines with Global Page Ordering

  2003cited by this paper
• Evaluating top-k queries over Web-accessible databases

  2002cited by this paper
• Compressing bitmap indexes for faster search operations

  2002influential reference
• Bit-sliced index arithmetic

  2001cited by this paper
• Optimal aggregation algorithms for middleware

  2001cited by this paper
• Notes on design and implementation of compressed bit vectors

  2001cited by this paper
• Optimizing Multi-Feature Queries for Image Databases

  2000cited by this paper
• Improved query performance with variant indexes

  1997cited by this paper
• Combining fuzzy information from multiple systems (extended abstract)

  1996cited by this paper
• Filtered Document Retrieval with Frequency-Sorted Indexes

  1996cited by this paper
• Byte-aligned bitmap compression

  1995cited by this paper

• Large-Scale Metric Computation in Online Controlled Experiment Platform

  2024cites this paper
• Progress on Artificial Neural Networks for Big Data Analytics: A Survey

  2019cites this paper
• Fast and Efficient In-Memory Big Data Processing

  2019cites this paper
• Information Fusion for Multi-Source Material Data: Progress and Challenges

  2019cites this paper
• ΑΡΙΣΤΟΤΕΛΕΙΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΟΝΙΚΗΣ

  2018cites this paper
• Studying Recommender Systems to Enhance Distributed Computing Schedulers

  2016cites this paper