Bitmap Index an Efficient Approach to Improve Performance of Data Warehouse Queries
|
|
- Hortense Goodman
- 8 years ago
- Views:
Transcription
1 Bitmap Index an Efficient Approach to Improve Performance of Data Warehouse Queries Kale Sarika Prakash 1, P. M. Joe Prathap 2 1 Research Scholar, Department of Computer Science and Engineering, St. Peters Institute of Higher Education and Research, St. Peters University, Chennai, India 2 Associate Professor, Department of Information Technology, RMD College of Engineering, Chennai, India Abstract In today s era, due to involvement of advanced and scientific computing in all field of engineering and sciences the processing of application generates huge number of parameters related to that application. Data warehouse collects all such huge information related to same application from various external data sources. Decision support system work on this platform created by Data warehouse and help decision making process of organization. As the Data warehouse is huge and complex, effectively retrieving information from such a huge database is the challenge in front of the researchers. The nature of the queries to be fired on Data warehouse are Iceberg query, aggregation query, equality query and membership query. As data warehouse is huge,directly executing query on such a huge dataset is not efficient way.in this case first up all we have to create index on Data warehouse and then we have to execute query on it.four indexing types are mainly used in database system such as B Tree, R Tree,Hash Index and Bitmap Index. Out of this first three are traditional techniques which are suitable for Online Transaction Processing system (OLTP) whereas Bitmap indexing is suitable for Online Analytical processing (OLAP) system. The performance of Data warehouse is depends upon the time required to execute query on it. Improving the performance of query in Data warehouse and decision support system is challenge in front of the researchers. In this paper we studied different indexing strategies available and through our experimental result we come to the conclusion that indexing technique base on Bitmap representation is the appropriate choice for Data warehouse query processing, which help to improve the performance of Data warehouse query. Keywords Data warehouse(dw),iceberg query (IBQ), Online transaction processing (OLTP), Online Analytical processing(olap),bitmap Index(BI) I. INTRODUCTION Due to involvement of modern and scientific techniques in engineering and science application,data generated by it is huge and complex. Data warehouse(dw) size and complexity is increased day by day. Data warehouse (DW) is a huge collection of dataset which is integrated, subject oriented,time-variant and Non volatile [ 1]. Data warehouse(dw) collects the data from various external sources that data may be in different format or structure. Data warehouse brings it in common platform and provide it to Decision support System(DSS),which helps in decision making process of organization. Generally the query fired on warehouse is Iceberg query, aggregation query, equality query and membership query. Iceberg query contain aggregation function followed by having clause with some threshold condition. These queries work on huge database but actually answer to the query is from some selected record only. It completely depends upon where clause and threshold condition present in query. To extract such a small information efficiently from very huge dataset is the challenge in front of researchers. Various researchers has worked on to improve efficiency of Iceberg query using Bitmap indexing Technique [2,3,4,5,6]. Generally all the queries to be execute on DW are complicated and interactive in nature. Such a complicated queries require several minutes or hours or days to execute because huge amount of data to be scanned from DW. After scanning complete huge dataset as per the requirement of query the answer is generated.in this case scanning whole database and along with it processing the same is time consuming process. To improve efficiency of Iceberg query or any DW query is the challenging task. Various researchers has proposed different strategies to improve the performance of DW query. These strategies are summary table generation and indexing[1,8,9]. Summary table approach create and store aggregated and summarized data to reduce DW query execution time.this is suitable only when queries are predicted. Based on predication attribute the summarized tables are generated and directly used for execution of query instead of using huge data warehouse this generated summary tables are used. But this technique is not suitable for unpredicted queries. Because for every such a query to form summarized table complete scan of DW table is needed and then on this table the execution of query will be done. 164
2 Accessing complete database, retrieving and aggregating actual data as per requirement of query reduces the DW query performance. For every such a new query follow all these steps is a time consuming approach[7]. Indexing is generally used in database system to increase the performance of database query. Index is created on particular columns of database, it helps in searching the tuples quickly. There are different types of indexing like B tree, Bitmap indexing etc. The B Tree data structure is widely used in relational database system. But it represents sorted data and perform different operations like insertion,deletion,modification and retrieval of tuples. As this data structure works on sorted data it is not suitable for handling huge or large database like data warehouse.it is suitable for OLTP System. However Data warehouse works on read only mode, bitmap indexing takes advantage of this property of Data warehouse [1,8,9]. Modern data warehouses stores high dimensional data generated from different scientific, engineering applications. Due to this high dimensionality and huge data set time required for query processing is increases drastically. As DW plays vital role in decision making process of organization,it generally required very small data from huge data set. Bitmap indexing is suitable for DW due to this two reasons: First due to the properties of DW like huge data base, read only and updates are not frequent. Second the nature of query to be executed on DW i.e. Extraction of small information from huge set. Bitmap Indexing is common technique for processing complex,multidimensional and adhoc queries, different commercial DBMS products introduces bitmap indexing in it like Sybase, IBM, Red Bricks and Oracle[10]. In this paper we are focusing on the suitability of Bitmap indexing for DW query. Our experimental results shows that BI is suitable for Data warehouse (DW),DSS and OLAP System.Remaining paper is organized in following fashion. Section II focus on Bitmap Indexing, section III Comparison between B Tree and Bitmap indexing and in Section IV we have present the experimental results to measure the performance of Bitmap Indexing,Finally section V is conclusion of our study is presented. II. BITMAP INDEXING TECHNIQUE Bitmap index was implemented first time in Model 204 DBMS[10]. It consists of b number of bitmap vector which is the number of unique value present in respective column. The b is the cardinality value of attribute column. Bit map vector is the combination of binary number zero s and one s. In bit map vector v bit value = 1 if it associate with respective bitmap else it is zero. 165 Table I shows simple relation and table II shows the bitmap vector created on Position column. The cardinality of bitmap vector on position attribute is ={ First,second,Third}. TABLE I BASIC RELATION Id Name Position Age Location 1 Sudha First 10 Pune 2 Subodh First 20 Mumbai 3 Radha Third 15 Nasik 4 Megha Second 20 Aurangabad 5 Priya Third 12 Pune 6 Anu Second 23 Pune 7 Ram First 22 Aurangabad 8 Raj Third 33 Mumbai TABLE II BITMAP INDEX ON POSITION COLUMN Id First Second Third We can execute queries like Iceberg Query (IBQ), equality queries, membership queries and aggregation queries on bit map vector. To generate result of IBQ we have to make use of OR and XOR operation.
3 To generate result of an equality queries the value mentioned in predicate condition is read into memory. Whereas in case of membership queries if more than one bitmap vector is present then Bitwise OR operation is performed n-1 time on complete bitmap vector, where n is the size of bitmap vector[11]. Bit map Index uses all distinct value of the attribute to be index as key value to each index. It then generates the bitmap for each Key value. Further for query processing this bitmap index values are used and results are generated by using different Boolean operation like AND,OR and XOR [10].The size of bitmap index is relatively small in case of low cardinality attributes like Gender ={ male,female }.In case of values generated after every transaction is more the cardinality will be very high. In such a type of situations the bitmap index is designed with Bins [12].In this case attribute values are partition into number of bins and generates bitmap vectors to represent bins rather distinct keys. Due to this approach binning reduces storage space but increases access time in case of boundary value accessing. If simple bitmap is build on high cardinality attribute then it requires more memory space and query processing time will be increased[11]. Most of the researchers have worked to overcome this problem.they developed this two strategies:1) Implementation of different Bitmap Index compression algorithm 2)Algorithms for Bitmap Index extension[13].under first method two types are developed World Aligned Hybrid(WAH)[13,14] and Run length Huffman(RLH).Both this techniques significantly reduces the storage space for bitmap index. But direct query processing is not possible on such a compressed bitmap. So before executing it must decompressed first and then query processing will perform on the same, which is again a time consuming process. Whereas in second approach each bitmap index is encoded with number which extends the representation format but space required to store is small and data access time is also get reduced [7].As storage space and data access problem is overcome by above research, bitmap indexing(bi) approach is well suitable for high cardinality attributes. Generally scientific queries involved with multidimensional query processing. As it is huge data and is used for analysis purpose it is not frequently updated almost till the end of analysis work it remains same. The nature of such a data is read only, so once bitmap index is created it remain fixed for all type OLAP query on respective attribute. Initial cost of bitmap creation is involved but after first iteration time required to execute query will get reduced drastically. 166 In our results we observe that if we execute the query repeatedly on same BI then time required to execute get reduced. Through our experimental result we noticed that Bitmap Indexing is suitable choice for DW query processing. III. COMPARISON BETWEEN B TREE AND BITMAP INDEXING Different Database Management System like Oracle,IBM Sybase etc. uses B Tree as a normal indexing for relational databases. They have included Bitmap Indexing strategies also. But selection of indexing techniques as per the need of application is important factor. This helps to get query result fast. Table IV shows the difference between B Tree and BI. TABLE III DIFFERENCE BETWEEN B TREE AND BI Sr.No. B Tree Index Bitmap Index(BI) 1. Balanced tree structure is used in B-Tree for efficient Bitmap uses matrix structure with zero and one bit value. record retrieval. 2. B Tree Indexing does not index NULL Values NULL values are indexed in Bitmap Indexing 3. Update,delete and insert operation does not affect the structure of B Tree.Based on value balanced tree get modified. 4. B-Tree index updates on Key values has relateviely inexpensive. 5. In this case optimizer are not directly work on boolean operations. 6. B tree is suitable for Online Transaction Processing Sytem where databases are updated frequently. 7. Performance of B Tree Degrades for nested queries 8. It is suitable relational databases where frequent database updates are necessary. 9. Compare to Bitmap indexing it is slow as it is not directly work on boolean operations. Update,delete and insert operation completely affect the structure of Bitmap index.after any operation new bitmap index has to prepare. Bitmap Index update, delete has more expensive. Optimizers answers queries containg AND,OR or XOR operation. It is suitable for Data warehouse and decision support system where database is not updated frequently. Bitmap Index performance is better than B tree when queries are nested and complicated. It is suitable for Static databases where updates are not so frequent.. Bitmap indexing is fast as it work on boolean operations which are directly compatable with hardware.
4 IV. EXPERIMENT TO MEASURE PERFORMANCE OF INDEXING To measure the performance of Indexing strategy we perform the experiment on databases with 5 lack,10 lack and 15 lack tuples. On this variety of databases we execute the queries of different complexity. Initially we consider simple query with only one condition. We execute it on all three databases.in all these query performance in terms of time required to execute is recorded. Same query is executed seven to eight times and results are recorded for analysis.same procedure is repeated for all the queries. We perform the experimentation on Oracle 11g database. Our experimentation is based on following three cases. Case1: Simple Query with one condition only. Input Query: Select products,states,count(*) from sales group by products,states HAVING count(*) >= 100 databases is summarized in Table V and graphical representation of the same is shown in Figure 1. In all these cases performance of Bitmap indexing is good compare to B tree and without using indexing strategy. The performance of Bitmap indexing is excellent in case of large database. The time is directly reduces from 1000 m sec to 184 msec,145 msec,121 msec after each iteration time in bitmap indexing get reduced repeatedly. This is the important feature which proves applicability of Bitmap indexing in Data warehouse query processing. Case2: Query with two condition. Input Query: select products, states, count(*) from sales2 where states='bihar' group by products, states Having count(*) >= 100 databases is summarized in Table VI and graphical representation of the same is shown in Figure 2. The performance of Bitmap indexing is excellent in case of large database. The time is directly reduces from 1000 m sec to 105 msec,22 msec. Compare to case 1 even though the complexity of query increases then also time required to execute query get reduced.from this observation we can say that database size and query complexity does not affect the performance of Bitmap Indexing rather the performance is improved. Case 3: Query with three condition, Input Query: select products, states, count(*) from sales2 where states='bihar' AND products='garlic' group by products, states Having count(*) >= 100 databases is summarized in Table VII and graphical representation of the same is shown in Figure 3. The performance of Bitmap indexing is excellent in case of large database. The time is directly reduces from 1000 msec to 24 msec. Compare to case 1 and case 2 even though the complexity of query increases then also time required to execute query get reduced. This final observation is very useful to prove suitability of Bitmap indexing for data warehouse query processing. FIG I CASE1: QUERY WITH ONE CONDITION FIG II CASE1: QUERY WITH TWO CONDITION 167
5 FIG III CASE1: QUERY WITH TWO CONDITION In all above case1,case2,case3 the performance of Bitmap indexing is better in terms of time required to execute the query. After analyzing this result we have following observations: 1. The performance of BI is better in all case1,case2,case3 on different size of databases. 2. On large size database( i.e. sales2) with all cases i.e case1,case2,case3 the performance of BI is good and comparatively better in case of large size database. 3. We noticed that after every iteration time required to execute the query get reduced. 4. Even though the complexity of query increases then also in case of BI time required to execute query is decreases. V. CONCLUSION In this paper suitability of Bitmap Indexing for increasing speed of DW query is proved. A critical issue for DW system is ability to answer queries quickly. Bitmap Indexing strategy is proved to be time efficient for answering Data warehouse queries by performing fast Boolean operation on index level instead of executing queries on main database. Bitmap indexing is suitable for data warehouse because of static and read only nature of Data warehouse. Also the data warehouse is not frequently updated. Because of all this properties of Data Warehouse BI is suitable for it. In this paper we perform analytical and experimental study of Bitmap Indexing and B Tree Indexing strategies. We compare the results of BI with B Tree index with and without using indexing strategy. From our experimental result we come to the conclusion that Bitmap indexing performance is good compare to B Tree and without using indexing strategy. We noticed that Bitmap indexing performance is better even though the database size and query complexity increase. Thus we can say that Bitmap indexing is suitable approach for data warehouse queries like Iceberg query, membership query and equality query. REFERENCES [1] S.Chaudhari and U.Dayal, An Overview of Data Warehousing and OLAP Technology,ACM SIGMOD RECORD,Vol.26,pp.65-74,1997 [2] Bin He,Hui-l Hsiao,Ziyang Liu,Yu Huang and Yi Chen, Efficient Iceberg Query Evaluation Using Compressed Bitmap Index,IEEE Transaction on knowledge and data engineering,vol.24,no.9, September [3] C.V.Guru Rao, V. Shankar, Efficient Iceberg Query Evaluation Using Compressed Bitmap Index by Deferring Bitwise- XOR Operations, /12/$31.00c 2012 IEEE. [4] C.V.Guru Rao, V. Shankar, Computing Iceberg Queries Efficiently Using Bitmap Index Positions,DOI: /ICHCI- IEEE Publication Year: 2013,Page(s): 1 6. [5] V.Chandra Shekhar Rao,P. Sammulal, Efficient Iceberg Query Evaluation Using Set Representation, IEEE India Conference(INDICON) [6] Vuppu.Shankar, C.V.Guru Rao, Cache based evaluation of iceberg queries,ieee ICCCT 2014, 2014,DOI: /ICCCT [7] Amorntep Keawpibal,Niwan Wattanakitrungroj and Sirirut Vanichayobon, Enhanced Encoded Bitmap Index for Equality Query,IEEE,Publication Year 2012, Pg.no [8] P.O Neil and D.Quass, Improved Query Performance with Variant Indexes,Proceeding 1997 ACM SIGMOD International conference on Management of Data,pp.38-49,1997. [9] C.Y.Chan and Y.E.Ioannidis, Bitmap Index Design and Evaluation,ACM SIGMOD International conference on Management of Data,pp ,1988 [10] P.O Neil.Model 204 Architecture and Performance,2 nd International Workshop in High Performance Transaction System,USA,1987,Springer-Verlag. [11] Weahason Weahama,Sirirut Vanichayobon and Jarin Manfuekphan, Using Data Clustering to optimize Scatter Bitmap Index for Membership Queries,IEEE International Conference on Computer and Automation Engineering [12] K.Stockinger,K.Wu, and A.Shoshani, Evaluation Strategies for bitmap indices with Binning,International Conference on Database and Expert System Applications(DEXA),September 2004,Springer- Verlag [13] M.Stabno and R.Wrembel, RLH:Bitmap Compression Technique Based on Run-length and Huffman Encoding,Information Systems,Vol 34, ,2009. [14] K.Wu,E.J.Otoo and A.Shoshani, Optimizing bitmap indices with efficient compression,acm Transaction on Database System,vol31,pp.1-38,
Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse
Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse Zainab Qays Abdulhadi* * Ministry of Higher Education & Scientific Research Baghdad, Iraq Zhang Zuping Hamed Ibrahim Housien**
More informationIndexing Techniques for Data Warehouses Queries. Abstract
Indexing Techniques for Data Warehouses Queries Sirirut Vanichayobon Le Gruenwald The University of Oklahoma School of Computer Science Norman, OK, 739 sirirut@cs.ou.edu gruenwal@cs.ou.edu Abstract Recently,
More informationEfficient Iceberg Query Evaluation for Structured Data using Bitmap Indices
Proc. of Int. Conf. on Advances in Computer Science, AETACS Efficient Iceberg Query Evaluation for Structured Data using Bitmap Indices Ms.Archana G.Narawade a, Mrs.Vaishali Kolhe b a PG student, D.Y.Patil
More informationEvaluation of Bitmap Index Compression using Data Pump in Oracle Database
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 3, Ver. III (May-Jun. 2014), PP 43-48 Evaluation of Bitmap Index Compression using Data Pump in Oracle
More informationIndexing Techniques in Data Warehousing Environment The UB-Tree Algorithm
Indexing Techniques in Data Warehousing Environment The UB-Tree Algorithm Prepared by: Yacine ghanjaoui Supervised by: Dr. Hachim Haddouti March 24, 2003 Abstract The indexing techniques in multidimensional
More informationTurkish Journal of Engineering, Science and Technology
Turkish Journal of Engineering, Science and Technology 03 (2014) 106-110 Turkish Journal of Engineering, Science and Technology journal homepage: www.tujest.com Integrating Data Warehouse with OLAP Server
More informationlow-level storage structures e.g. partitions underpinning the warehouse logical table structures
DATA WAREHOUSE PHYSICAL DESIGN The physical design of a data warehouse specifies the: low-level storage structures e.g. partitions underpinning the warehouse logical table structures low-level structures
More informationDATA WAREHOUSING II. CS121: Introduction to Relational Database Systems Fall 2015 Lecture 23
DATA WAREHOUSING II CS121: Introduction to Relational Database Systems Fall 2015 Lecture 23 Last Time: Data Warehousing 2 Last time introduced the topic of decision support systems (DSS) and data warehousing
More informationPartJoin: An Efficient Storage and Query Execution for Data Warehouses
PartJoin: An Efficient Storage and Query Execution for Data Warehouses Ladjel Bellatreche 1, Michel Schneider 2, Mukesh Mohania 3, and Bharat Bhargava 4 1 IMERIR, Perpignan, FRANCE ladjel@imerir.com 2
More informationInvestigating the Effects of Spatial Data Redundancy in Query Performance over Geographical Data Warehouses
Investigating the Effects of Spatial Data Redundancy in Query Performance over Geographical Data Warehouses Thiago Luís Lopes Siqueira Ricardo Rodrigues Ciferri Valéria Cesário Times Cristina Dutra de
More informationDataset Preparation and Indexing for Data Mining Analysis Using Horizontal Aggregations
Dataset Preparation and Indexing for Data Mining Analysis Using Horizontal Aggregations Binomol George, Ambily Balaram Abstract To analyze data efficiently, data mining systems are widely using datasets
More informationWhen to consider OLAP?
When to consider OLAP? Author: Prakash Kewalramani Organization: Evaltech, Inc. Evaltech Research Group, Data Warehousing Practice. Date: 03/10/08 Email: erg@evaltech.com Abstract: Do you need an OLAP
More informationQuery Optimization Approach in SQL to prepare Data Sets for Data Mining Analysis
Query Optimization Approach in SQL to prepare Data Sets for Data Mining Analysis Rajesh Reddy Muley 1, Sravani Achanta 2, Prof.S.V.Achutha Rao 3 1 pursuing M.Tech(CSE), Vikas College of Engineering and
More informationENHANCEMENTS TO SQL SERVER COLUMN STORES. Anuhya Mallempati #2610771
ENHANCEMENTS TO SQL SERVER COLUMN STORES Anuhya Mallempati #2610771 CONTENTS Abstract Introduction Column store indexes Batch mode processing Other Enhancements Conclusion ABSTRACT SQL server introduced
More informationPreparing Data Sets for the Data Mining Analysis using the Most Efficient Horizontal Aggregation Method in SQL
Preparing Data Sets for the Data Mining Analysis using the Most Efficient Horizontal Aggregation Method in SQL Jasna S MTech Student TKM College of engineering Kollam Manu J Pillai Assistant Professor
More informationDEVELOPMENT OF HASH TABLE BASED WEB-READY DATA MINING ENGINE
DEVELOPMENT OF HASH TABLE BASED WEB-READY DATA MINING ENGINE SK MD OBAIDULLAH Department of Computer Science & Engineering, Aliah University, Saltlake, Sector-V, Kol-900091, West Bengal, India sk.obaidullah@gmail.com
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 29-1
Slide 29-1 Chapter 29 Overview of Data Warehousing and OLAP Chapter 29 Outline Purpose of Data Warehousing Introduction, Definitions, and Terminology Comparison with Traditional Databases Characteristics
More informationPostgreSQL Business Intelligence & Performance Simon Riggs CTO, 2ndQuadrant PostgreSQL Major Contributor
PostgreSQL Business Intelligence & Performance Simon Riggs CTO, 2ndQuadrant PostgreSQL Major Contributor The research leading to these results has received funding from the European Union's Seventh Framework
More informationAn Algorithm to Evaluate Iceberg Queries for Improving The Query Performance
INTERNATIONAL OPEN ACCESS JOURNAL ISSN: 2249-6645 OF MODERN ENGINEERING RESEARCH (IJMER) An Algorithm to Evaluate Iceberg Queries for Improving The Query Performance M.Laxmaiah 1, A.Govardhan 2 1 Department
More informationIn-memory databases and innovations in Business Intelligence
Database Systems Journal vol. VI, no. 1/2015 59 In-memory databases and innovations in Business Intelligence Ruxandra BĂBEANU, Marian CIOBANU University of Economic Studies, Bucharest, Romania babeanu.ruxandra@gmail.com,
More informationIn-Memory Columnar Databases HyPer. Arto Kärki University of Helsinki 30.11.2012
In-Memory Columnar Databases HyPer Arto Kärki University of Helsinki 30.11.2012 1 Introduction Columnar Databases Design Choices Data Clustering and Compression Conclusion 2 Introduction The relational
More informationImprove Data Warehouse Performance by Preprocessing and Avoidance of Complex Resource Intensive Calculations
www.ijcsi.org 202 Improve Data Warehouse Performance by Preprocessing and Avoidance of Complex Resource Intensive Calculations Muhammad Saqib 1, Muhammad Arshad 2, Mumtaz Ali 3, Nafees Ur Rehman 4, Zahid
More informationEfficient Integration of Data Mining Techniques in Database Management Systems
Efficient Integration of Data Mining Techniques in Database Management Systems Fadila Bentayeb Jérôme Darmont Cédric Udréa ERIC, University of Lyon 2 5 avenue Pierre Mendès-France 69676 Bron Cedex France
More informationMulti-dimensional index structures Part I: motivation
Multi-dimensional index structures Part I: motivation 144 Motivation: Data Warehouse A definition A data warehouse is a repository of integrated enterprise data. A data warehouse is used specifically for
More informationHorizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661, ISBN: 2278-8727 Volume 6, Issue 5 (Nov. - Dec. 2012), PP 36-41 Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
More informationLecture Data Warehouse Systems
Lecture Data Warehouse Systems Eva Zangerle SS 2013 PART C: Novel Approaches Column-Stores Horizontal/Vertical Partitioning Horizontal Partitions Master Table Vertical Partitions Primary Key 3 Motivation
More informationData Warehousing Concepts
Data Warehousing Concepts JB Software and Consulting Inc 1333 McDermott Drive, Suite 200 Allen, TX 75013. [[[[[ DATA WAREHOUSING What is a Data Warehouse? Decision Support Systems (DSS), provides an analysis
More informationOptimizing the Performance of the Oracle BI Applications using Oracle Datawarehousing Features and Oracle DAC 10.1.3.4.1
Optimizing the Performance of the Oracle BI Applications using Oracle Datawarehousing Features and Oracle DAC 10.1.3.4.1 Mark Rittman, Director, Rittman Mead Consulting for Collaborate 09, Florida, USA,
More informationHSTB-index: A Hierarchical Spatio-Temporal Bitmap Indexing Technique
HSTB-index: A Hierarchical Spatio-Temporal Bitmap Indexing Technique Cesar Joaquim Neto 1, 2, Ricardo Rodrigues Ciferri 1, Marilde Terezinha Prado Santos 1 1 Department of Computer Science Federal University
More informationData Warehousing and Decision Support. Introduction. Three Complementary Trends. Chapter 23, Part A
Data Warehousing and Decision Support Chapter 23, Part A Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1 Introduction Increasingly, organizations are analyzing current and historical
More informationHorizontal Aggregations In SQL To Generate Data Sets For Data Mining Analysis In An Optimized Manner
24 Horizontal Aggregations In SQL To Generate Data Sets For Data Mining Analysis In An Optimized Manner Rekha S. Nyaykhor M. Tech, Dept. Of CSE, Priyadarshini Bhagwati College of Engineering, Nagpur, India
More informationData Warehouse: Introduction
Base and Mining Group of Base and Mining Group of Base and Mining Group of Base and Mining Group of Base and Mining Group of Base and Mining Group of Base and Mining Group of base and data mining group,
More informationNamrata 1, Dr. Saket Bihari Singh 2 Research scholar (PhD), Professor Computer Science, Magadh University, Gaya, Bihar
A Comprehensive Study on Data Warehouse, OLAP and OLTP Technology Namrata 1, Dr. Saket Bihari Singh 2 Research scholar (PhD), Professor Computer Science, Magadh University, Gaya, Bihar Abstract: Data warehouse
More informationData Warehousing and Data Mining in Business Applications
133 Data Warehousing and Data Mining in Business Applications Eesha Goel CSE Deptt. GZS-PTU Campus, Bathinda. Abstract Information technology is now required in all aspect of our lives that helps in business
More informationThe Cubetree Storage Organization
The Cubetree Storage Organization Nick Roussopoulos & Yannis Kotidis Advanced Communication Technology, Inc. Silver Spring, MD 20905 Tel: 301-384-3759 Fax: 301-384-3679 {nick,kotidis}@act-us.com 1. Introduction
More informationDecision Support. Chapter 23. Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1
Decision Support Chapter 23 Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1 Introduction Increasingly, organizations are analyzing current and historical data to identify useful
More informationAssociate Professor, Department of CSE, Shri Vishnu Engineering College for Women, Andhra Pradesh, India 2
Volume 6, Issue 3, March 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Special Issue
More informationDATA WAREHOUSING AND OLAP TECHNOLOGY
DATA WAREHOUSING AND OLAP TECHNOLOGY Manya Sethi MCA Final Year Amity University, Uttar Pradesh Under Guidance of Ms. Shruti Nagpal Abstract DATA WAREHOUSING and Online Analytical Processing (OLAP) are
More informationIndex Selection Techniques in Data Warehouse Systems
Index Selection Techniques in Data Warehouse Systems Aliaksei Holubeu as a part of a Seminar Databases and Data Warehouses. Implementation and usage. Konstanz, June 3, 2005 2 Contents 1 DATA WAREHOUSES
More informationCS54100: Database Systems
CS54100: Database Systems Date Warehousing: Current, Future? 20 April 2012 Prof. Chris Clifton Data Warehousing: Goals OLAP vs OLTP On Line Analytical Processing (vs. Transaction) Optimize for read, not
More informationCUBE INDEXING IMPLEMENTATION USING INTEGRATION OF SIDERA AND BERKELEY DB
CUBE INDEXING IMPLEMENTATION USING INTEGRATION OF SIDERA AND BERKELEY DB Badal K. Kothari 1, Prof. Ashok R. Patel 2 1 Research Scholar, Mewar University, Chittorgadh, Rajasthan, India 2 Department of Computer
More informationA Survey on Data Warehouse Architecture
A Survey on Data Warehouse Architecture Rajiv Senapati 1, D.Anil Kumar 2 1 Assistant Professor, Department of IT, G.I.E.T, Gunupur, India 2 Associate Professor, Department of CSE, G.I.E.T, Gunupur, India
More informationLection 3-4 WAREHOUSING
Lection 3-4 DATA WAREHOUSING Learning Objectives Understand d the basic definitions iti and concepts of data warehouses Understand data warehousing architectures Describe the processes used in developing
More informationChapter 3 Data Warehouse - technological growth
Chapter 3 Data Warehouse - technological growth Computing began with data storage in conventional file systems. In that era the data volume was too small and easy to be manageable. With the increasing
More informationTwo-Phase Data Warehouse Optimized for Data Mining
Two-Phase Data Warehouse Optimized for Data Mining Balázs Rácz András Lukács Csaba István Sidló András A. Benczúr Data Mining and Web Search Research Group Computer and Automation Research Institute Hungarian
More informationRethinking SIMD Vectorization for In-Memory Databases
SIGMOD 215, Melbourne, Victoria, Australia Rethinking SIMD Vectorization for In-Memory Databases Orestis Polychroniou Columbia University Arun Raghavan Oracle Labs Kenneth A. Ross Columbia University Latest
More informationDYNAMIC QUERY FORMS WITH NoSQL
IMPACT: International Journal of Research in Engineering & Technology (IMPACT: IJRET) ISSN(E): 2321-8843; ISSN(P): 2347-4599 Vol. 2, Issue 7, Jul 2014, 157-162 Impact Journals DYNAMIC QUERY FORMS WITH
More informationLossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding
Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding C. SARAVANAN cs@cc.nitdgp.ac.in Assistant Professor, Computer Centre, National Institute of Technology, Durgapur,WestBengal,
More informationOracle Database In-Memory The Next Big Thing
Oracle Database In-Memory The Next Big Thing Maria Colgan Master Product Manager #DBIM12c Why is Oracle do this Oracle Database In-Memory Goals Real Time Analytics Accelerate Mixed Workload OLTP No Changes
More informationData Warehousing. Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de. Winter 2015/16. Jens Teubner Data Warehousing Winter 2015/16 1
Jens Teubner Data Warehousing Winter 2015/16 1 Data Warehousing Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de Winter 2015/16 Jens Teubner Data Warehousing Winter 2015/16 13 Part II Overview
More informationBUILDING BLOCKS OF DATAWAREHOUSE. G.Lakshmi Priya & Razia Sultana.A Assistant Professor/IT
BUILDING BLOCKS OF DATAWAREHOUSE G.Lakshmi Priya & Razia Sultana.A Assistant Professor/IT 1 Data Warehouse Subject Oriented Organized around major subjects, such as customer, product, sales. Focusing on
More informationMain Memory Data Warehouses
Main Memory Data Warehouses Robert Wrembel Poznan University of Technology Institute of Computing Science Robert.Wrembel@cs.put.poznan.pl www.cs.put.poznan.pl/rwrembel Lecture outline Teradata Data Warehouse
More information<Insert Picture Here> Enhancing the Performance and Analytic Content of the Data Warehouse Using Oracle OLAP Option
Enhancing the Performance and Analytic Content of the Data Warehouse Using Oracle OLAP Option The following is intended to outline our general product direction. It is intended for
More informationwww.ijreat.org Published by: PIONEER RESEARCH & DEVELOPMENT GROUP (www.prdg.org) 28
Data Warehousing - Essential Element To Support Decision- Making Process In Industries Ashima Bhasin 1, Mr Manoj Kumar 2 1 Computer Science Engineering Department, 2 Associate Professor, CSE Abstract SGT
More informationData Warehousing. Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de. Winter 2014/15. Jens Teubner Data Warehousing Winter 2014/15 1
Jens Teubner Data Warehousing Winter 2014/15 1 Data Warehousing Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de Winter 2014/15 Jens Teubner Data Warehousing Winter 2014/15 152 Part VI ETL Process
More informationKeywords : Data Warehouse, Data Warehouse Testing, Lifecycle based Testing
Volume 4, Issue 12, December 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Lifecycle
More informationInge Os Sales Consulting Manager Oracle Norway
Inge Os Sales Consulting Manager Oracle Norway Agenda Oracle Fusion Middelware Oracle Database 11GR2 Oracle Database Machine Oracle & Sun Agenda Oracle Fusion Middelware Oracle Database 11GR2 Oracle Database
More informationAN APPROACH TO ANTICIPATE MISSING ITEMS IN SHOPPING CARTS
AN APPROACH TO ANTICIPATE MISSING ITEMS IN SHOPPING CARTS Maddela Pradeep 1, V. Nagi Reddy 2 1 M.Tech Scholar(CSE), 2 Assistant Professor, Nalanda Institute Of Technology(NIT), Siddharth Nagar, Guntur,
More informationData Warehousing With DB2 for z/os... Again!
Data Warehousing With DB2 for z/os... Again! By Willie Favero Decision support has always been in DB2 s genetic makeup; it s just been a bit recessive for a while. It s been evolving over time, so suggesting
More informationCaching Dynamic Skyline Queries
Caching Dynamic Skyline Queries D. Sacharidis 1, P. Bouros 1, T. Sellis 1,2 1 National Technical University of Athens 2 Institute for Management of Information Systems R.C. Athena Outline Introduction
More informationIN-MEMORY DATABASE SYSTEMS. Prof. Dr. Uta Störl Big Data Technologies: In-Memory DBMS - SoSe 2015 1
IN-MEMORY DATABASE SYSTEMS Prof. Dr. Uta Störl Big Data Technologies: In-Memory DBMS - SoSe 2015 1 Analytical Processing Today Separation of OLTP and OLAP Motivation Online Transaction Processing (OLTP)
More informationDesigning an Object Relational Data Warehousing System: Project ORDAWA * (Extended Abstract)
Designing an Object Relational Data Warehousing System: Project ORDAWA * (Extended Abstract) Johann Eder 1, Heinz Frank 1, Tadeusz Morzy 2, Robert Wrembel 2, Maciej Zakrzewicz 2 1 Institut für Informatik
More informationB.Sc (Computer Science) Database Management Systems UNIT-V
1 B.Sc (Computer Science) Database Management Systems UNIT-V Business Intelligence? Business intelligence is a term used to describe a comprehensive cohesive and integrated set of tools and process used
More informationIn-Memory Data Management for Enterprise Applications
In-Memory Data Management for Enterprise Applications Jens Krueger Senior Researcher and Chair Representative Research Group of Prof. Hasso Plattner Hasso Plattner Institute for Software Engineering University
More informationHOW INTERSYSTEMS TECHNOLOGY ENABLES BUSINESS INTELLIGENCE SOLUTIONS
HOW INTERSYSTEMS TECHNOLOGY ENABLES BUSINESS INTELLIGENCE SOLUTIONS A white paper by: Dr. Mark Massias Senior Sales Engineer InterSystems Corporation HOW INTERSYSTEMS TECHNOLOGY ENABLES BUSINESS INTELLIGENCE
More informationFact Sheet In-Memory Analysis
Fact Sheet In-Memory Analysis 1 Copyright Yellowfin International 2010 Contents In Memory Overview...3 Benefits...3 Agile development & rapid delivery...3 Data types supported by the In-Memory Database...4
More informationDatabases in Organizations
The following is an excerpt from a draft chapter of a new enterprise architecture text book that is currently under development entitled Enterprise Architecture: Principles and Practice by Brian Cameron
More informationData Warehousing and OLAP Technology for Knowledge Discovery
542 Data Warehousing and OLAP Technology for Knowledge Discovery Aparajita Suman Abstract Since time immemorial, libraries have been generating services using the knowledge stored in various repositories
More informationPerformance Improvement Techniques for Customized Data Warehouse
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-661, p- ISSN: 2278-8727Volume 9, Issue 3 (Mar. - Apr. 213), PP 1-5 Performance Improvement Techniques for Customized Data Warehouse Md. Al Mamun
More informationIBM DB2: LUW Performance Tuning and Monitoring for Single and Multiple Partition DBs
coursemonster.com/au IBM DB2: LUW Performance Tuning and Monitoring for Single and Multiple Partition DBs View training dates» Overview Learn how to tune for optimum performance the IBM DB2 9 for Linux,
More informationHow, What, and Where of Data Warehouses for MySQL
How, What, and Where of Data Warehouses for MySQL Robert Hodges CEO, Continuent. Introducing Continuent The leading provider of clustering and replication for open source DBMS Our Product: Continuent Tungsten
More informationOLAP and OLTP. AMIT KUMAR BINDAL Associate Professor M M U MULLANA
OLAP and OLTP AMIT KUMAR BINDAL Associate Professor Databases Databases are developed on the IDEA that DATA is one of the critical materials of the Information Age Information, which is created by data,
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume, Issue, March 201 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient Approach
More informationOptimization of ETL Work Flow in Data Warehouse
Optimization of ETL Work Flow in Data Warehouse Kommineni Sivaganesh M.Tech Student, CSE Department, Anil Neerukonda Institute of Technology & Science Visakhapatnam, India. Sivaganesh07@gmail.com P Srinivasu
More informationBusiness Benefits From Microsoft SQL Server Business Intelligence Solutions How Can Business Intelligence Help You? PTR Associates Limited
Business Benefits From Microsoft SQL Server Business Intelligence Solutions How Can Business Intelligence Help You? www.ptr.co.uk Business Benefits From Microsoft SQL Server Business Intelligence (September
More informationIn-Memory Databases Algorithms and Data Structures on Modern Hardware. Martin Faust David Schwalb Jens Krüger Jürgen Müller
In-Memory Databases Algorithms and Data Structures on Modern Hardware Martin Faust David Schwalb Jens Krüger Jürgen Müller The Free Lunch Is Over 2 Number of transistors per CPU increases Clock frequency
More informationReview. Data Warehousing. Today. Star schema. Star join indexes. Dimension hierarchies
Review Data Warehousing CPS 216 Advanced Database Systems Data warehousing: integrating data for OLAP OLAP versus OLTP Warehousing versus mediation Warehouse maintenance Warehouse data as materialized
More informationMS SQL Performance (Tuning) Best Practices:
MS SQL Performance (Tuning) Best Practices: 1. Don t share the SQL server hardware with other services If other workloads are running on the same server where SQL Server is running, memory and other hardware
More informationBuilding a Hybrid Data Warehouse Model
Page 1 of 13 Developer: Business Intelligence Building a Hybrid Data Warehouse Model by James Madison DOWNLOAD Oracle Database Sample Code TAGS datawarehousing, bi, All As suggested by this reference implementation,
More informationLecture Data Warehouse Systems
Lecture Data Warehouse Systems Eva Zangerle SS 2013 PART A: Architecture Chapter 1: Motivation and Definitions Motivation Goal: to build an operational general view on a company to support decisions in
More informationRESEARCH ON THE FRAMEWORK OF SPATIO-TEMPORAL DATA WAREHOUSE
RESEARCH ON THE FRAMEWORK OF SPATIO-TEMPORAL DATA WAREHOUSE WANG Jizhou, LI Chengming Institute of GIS, Chinese Academy of Surveying and Mapping No.16, Road Beitaiping, District Haidian, Beijing, P.R.China,
More informationRCFile: A Fast and Space-efficient Data Placement Structure in MapReduce-based Warehouse Systems CLOUD COMPUTING GROUP - LITAO DENG
1 RCFile: A Fast and Space-efficient Data Placement Structure in MapReduce-based Warehouse Systems CLOUD COMPUTING GROUP - LITAO DENG Background 2 Hive is a data warehouse system for Hadoop that facilitates
More informationMOC 20467B: Designing Business Intelligence Solutions with Microsoft SQL Server 2012
MOC 20467B: Designing Business Intelligence Solutions with Microsoft SQL Server 2012 Course Overview This course provides students with the knowledge and skills to design business intelligence solutions
More informationAlexander Nikov. 5. Database Systems and Managing Data Resources. Learning Objectives. RR Donnelley Tries to Master Its Data
INFO 1500 Introduction to IT Fundamentals 5. Database Systems and Managing Data Resources Learning Objectives 1. Describe how the problems of managing data resources in a traditional file environment are
More informationPrediction of Heart Disease Using Naïve Bayes Algorithm
Prediction of Heart Disease Using Naïve Bayes Algorithm R.Karthiyayini 1, S.Chithaara 2 Assistant Professor, Department of computer Applications, Anna University, BIT campus, Tiruchirapalli, Tamilnadu,
More informationQuickDB Yet YetAnother Database Management System?
QuickDB Yet YetAnother Database Management System? Radim Bača, Peter Chovanec, Michal Krátký, and Petr Lukáš Radim Bača, Peter Chovanec, Michal Krátký, and Petr Lukáš Department of Computer Science, FEECS,
More informationData Warehouses & OLAP
Riadh Ben Messaoud 1. The Big Picture 2. Data Warehouse Philosophy 3. Data Warehouse Concepts 4. Warehousing Applications 5. Warehouse Schema Design 6. Business Intelligence Reporting 7. On-Line Analytical
More information2010 Ingres Corporation. Interactive BI for Large Data Volumes Silicon India BI Conference, 2011, Mumbai Vivek Bhatnagar, Ingres Corporation
Interactive BI for Large Data Volumes Silicon India BI Conference, 2011, Mumbai Vivek Bhatnagar, Ingres Corporation Agenda Need for Fast Data Analysis & The Data Explosion Challenge Approaches Used Till
More informationIBM Cognos 8 Business Intelligence Analysis Discover the factors driving business performance
Data Sheet IBM Cognos 8 Business Intelligence Analysis Discover the factors driving business performance Overview Multidimensional analysis is a powerful means of extracting maximum value from your corporate
More informationFuture Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data
Volume 39 No10, February 2012 Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data Rajesh V Argiddi Assit Prof Department Of Computer Science and Engineering,
More information2.1 Basics: Indexing. 2.1 Primary Index. 2.1 Secondary Index. 2.1 Secondary Index. 2.1 Indexes. 2.1 Indexes 14.04.2009.
2. Architecture Data Warehousing & Mining Techniques Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 2. Architecture 2.1
More informationAlejandro Vaisman Esteban Zimanyi. Data. Warehouse. Systems. Design and Implementation. ^ Springer
Alejandro Vaisman Esteban Zimanyi Data Warehouse Systems Design and Implementation ^ Springer Contents Part I Fundamental Concepts 1 Introduction 3 1.1 A Historical Overview of Data Warehousing 4 1.2 Spatial
More informationApache Kylin Introduction Dec 8, 2014 @ApacheKylin
Apache Kylin Introduction Dec 8, 2014 @ApacheKylin Luke Han Sr. Product Manager lukhan@ebay.com @lukehq Yang Li Architect & Tech Leader yangli9@ebay.com Agenda What s Apache Kylin? Tech Highlights Performance
More informationA Comparative Study on Operational Database, Data Warehouse and Hadoop File System T.Jalaja 1, M.Shailaja 2
RESEARCH ARTICLE A Comparative Study on Operational base, Warehouse Hadoop File System T.Jalaja 1, M.Shailaja 2 1,2 (Department of Computer Science, Osmania University/Vasavi College of Engineering, Hyderabad,
More informationData Hierarchy. Traditional File based Approach. Hierarchy of Data for a Computer-Based File
Management Information Systems Data and Knowledge Management Dr. Shankar Sundaresan (Adapted from Introduction to IS, Rainer and Turban) LEARNING OBJECTIVES Recognize the importance of data, issues involved
More informationFast and Easy Delivery of Data Mining Insights to Reporting Systems
Fast and Easy Delivery of Data Mining Insights to Reporting Systems Ruben Pulido, Christoph Sieb rpulido@de.ibm.com, christoph.sieb@de.ibm.com Abstract: During the last decade data mining and predictive
More informationDistributed Framework for Data Mining As a Service on Private Cloud
RESEARCH ARTICLE OPEN ACCESS Distributed Framework for Data Mining As a Service on Private Cloud Shraddha Masih *, Sanjay Tanwani** *Research Scholar & Associate Professor, School of Computer Science &
More informationActian Vector in Hadoop
Actian Vector in Hadoop Industrialized, High-Performance SQL in Hadoop A Technical Overview Contents Introduction...3 Actian Vector in Hadoop - Uniquely Fast...5 Exploiting the CPU...5 Exploiting Single
More informationFinding Frequent Patterns Based On Quantitative Binary Attributes Using FP-Growth Algorithm
R. Sridevi et al Int. Journal of Engineering Research and Applications RESEARCH ARTICLE OPEN ACCESS Finding Frequent Patterns Based On Quantitative Binary Attributes Using FP-Growth Algorithm R. Sridevi,*
More informationQuery Optimization Techniques for OLAP Applications: An ORACLE versus MS-SQL Server Comparative Study
Query Optimization Techniques for OLAP Applications: An ORACLE versus MS-SQL Server Comparative Study Ahmed El-Ragal Arab Academy For Science and Technology College of Management and Technology Management
More information