Amanote Research
Register
Sign In
Minimizing I/O Costs of Multi-Dimensional Queries With Bitmap Indices
doi 10.1109/ssdbm.2006.33
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
D. Rotem
K. Stockinger
Publisher
IEEE
Related search
Optimizing Candidate Check Costs for Bitmap Indices
Bitmap Indices for Data Warehouses
Comment on Multi-Dimensional Indices
Journal of Economic Inequality
Sociology
Finance
Organizational Behavior
Economics
Political Science
Econometrics
Human Resource Management
Accelerating Multi Dimensional Queries in Data Warehouses
Compressed Bitmap Indices for Efficient Query Processing
Parity-Based Inference Control for Multi-Dimensional Range Sum Queries
Journal of Computer Security
Risk
Computer Networks
Hardware
Communications
Reliability
Safety
Architecture
Quality
Software
Taming XPath Queries by Minimizing Wildcard Steps
Compression Research of Bitmap Data in Three-Dimensional Printing
The Open Mechanical Engineering Journal
Browsing Hierarchical Data With Multi-Level Dynamic Queries and Pruning
International Journal of Human Computer Studies
Human-Computer Interaction
Human Factors
Hardware
Engineering
Ergonomics
Architecture
Education
Software
