EDBT 2010 - PDF Preprint Papers

EDBT 2010 International Conference on Extending Database Technology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EDBT-2010 Paper

click to vote

EDBT
2010
ACM

392views Database» more EDBT 2010»

Position list word aligned hybrid: optimizing space and performance for compressed bitmaps

14 years 7 months ago

Download www.edbt.org

Compressed bitmap indexes are increasingly used for efﬁciently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...

François Deliège, Torben Bach Peders...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	392	Position list word aligned hybrid: optimizing space and performance for compressed bitmaps	claim
2	289	B-Fabric: the Swiss Army Knife for life sciences	claim
3	246	Fast computation of SimRank for static and dynamic information networks	claim
4	237	BronzeGate: real-time transactional data obfuscation for GoldenGate	claim
5	210	Keyword search for data-centric XML collections with long text fields	claim
6	208	Stream schema: providing and exploiting static metadata for data stream processing	claim
7	206	Efficient computation of trade-off skylines	claim
8	205	Advanced knowledge discovery on movement data with the GeoPKDD system	claim
9	202	Querying trajectories using flexible patterns	claim
10	200	Rewrite techniques for performance optimization of schema matching processes	claim
11	189	Efficient physical operators for cost-based XPath execution	claim
12	188	Subsumption and complementation as data fusion operators	claim
13	188	DEDUCE: at the intersection of MapReduce and stream processing	claim
14	185	Optimizing joins in a map-reduce environment	claim
15	185	BP-Ex: a uniform query engine for business process execution traces	claim
16	185	Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space	claim
17	184	Aggregation of asynchronous electric power consumption time series knowing the integral	claim
18	184	PARINDA: an interactive physical designer for PostgreSQL	claim
19	182	BIAEditor: matching process and operational data for a business impact analysis	claim
20	181	Private record matching using differential privacy	claim
21	180	BSkyTree: scalable skyline computation using a balanced pivot selection	claim
22	180	k-symmetry model for identity anonymization in social networks	claim
23	177	Bridging the gap between intensional and extensional query evaluation in probabilistic databases	claim
24	177	PerK: personalized keyword search in relational databases through preferences	claim
25	172	Privacy preserving group nearest neighbor queries	claim
26	170	Augmenting OLAP exploration with dynamic advanced analytics	claim
27	164	Techniques for efficiently querying scientific workflow provenance graphs	claim
28	160	Scalable ontology-based information systems	claim
29	156	Pattern detector: fast detection of suspicious stream patterns for immediate reaction	claim
30	155	Reducing metadata complexity for faster table summarization	claim
31	155	Suffix tree construction algorithms on modern hardware	claim
32	153	Suggestion of promising result types for XML keyword search	claim
33	153	Beyond pages: supporting efficient, scalable entity search with dual-inversion index	claim
34	152	Feedback-based annotation, selection and refinement of schema mappings for dataspaces	claim
35	151	Warm cache costing: a feedback optimization technique for buffer pool aware costing	claim
36	151	The Data Cyclotron query processing scheme	claim
37	150	Gossiping personalized queries	claim
38	149	Statistics-based parallelization of XPath queries in shared memory systems	claim
39	147	A simple (yet powerful) algebra for pervasive environments	claim
40	145	Splash: ad-hoc querying of data and statistical models	claim
41	144	Timely YAGO: harvesting, querying, and visualizing temporal knowledge from Wikipedia	claim
42	143	Efficient and scalable multi-geography route planning	claim
43	141	Adaptive join processing in pipelined plans	claim
44	138	How to authenticate graphs without leaking	claim
45	138	Fast ELCA computation for keyword queries on XML data	claim
46	137	Fine-grained and efficient lineage querying of collection-based workflow provenance	claim
47	136	Minimizing database repros using language grammars	claim
48	135	Region-based online promotion analysis	claim
49	135	Probabilistic ranking over relations	claim
50	135	Querying spatial patterns	claim
51	133	FPGAs: a new point in the database design space	claim
52	132	Turbo-charging hidden database samplers with overflowing queries and skew reduction	claim
53	132	Algorithm-safe privacy-preserving data publishing	claim
54	127	Trustworthy vacuuming and litigation holds in long-term high-integrity records retention	claim
55	127	Querying the deep web	claim
56	125	A plan for OLAP	claim
57	123	Lost source provenance	claim
58	122	Self-selecting, self-tuning, incrementally optimized indexes	claim
59	119	Indexing relations on the web	claim
60	117	Anchoring millions of distinct reads on the human genome within seconds	claim
61	116	HARRA: fast iterative hashed record linkage for large-scale data collections	claim
62	110	The hardness and approximation algorithms for l-diversity	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers