DOCSLIB.ORG

Implementing an Infosphere Optim Data Growth Solution

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Implementing an Infosphere Optim Data Growth Solution Front cover IBM® Information Management Software Implementing an InfoSphere Optim Data Growth Solution Understanding the InfoSphere Optim Data Growth solution architectures Implementing InfoSphere Optim Data Growth solutions Managing data growth with flexibility Whei-Jen Chen David Alley Barbara Brown Sunil Dravida Saunnie Dunne Tom Forlenza Pamela S Hoffman Tejinder S Luthra Rajat Tiwary Claudio Zancani ibm.com/redbooks International Technical Support Organization Implementing an InfoSphere Optim Data Growth Solution November 2011 SG24-7936-00 Note: Before using this information and the product it supports, read the information in “Notices” on page xi. First Edition (November 2011) This edition applies to IBM InfoSphere Optim Data Growth Solution Version 7.3.1. © Copyright International Business Machines Corporation 2011. All rights reserved. Note to U.S. Government Users Restricted Rights -- Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Notices . xi Trademarks . xii Preface . xiii The team who wrote this book . xiii Acknowledgements . xvi Now you can become a published author, too! . xvii Comments welcome. xvii Stay connected to IBM Redbooks . xviii Chapter 1. Introduction to IBM InfoSphere Optim . 1 1.1 Challenges . 2 1.1.1 Data explosion . 2 1.1.2 Current approaches . 3 1.2 Information governance. 3 1.3 IBM role in information governance. 4 1.3.1 History . 4 1.3.2 IBM approach to data governance . 5 1.3.3 Data governance maturity model . 7 1.4 Information lifecycle management. 8 1.4.1 Benefits of implementing the correct ILM strategy . 11 1.4.2 What is data archiving. 11 1.5 IBM InfoSphere Optim Data Growth Solution . 12 1.6 Education support . 13 1.6.1 IBM Professional Certification . 14 1.6.2 Information Management Software Services . 15 1.6.3 Protect your software investment: Ensure that you renew your Software Subscription and Support . 16 Chapter 2. Project planning and considerations . 17 2.1 Project management . 18 2.1.1 Project methodology . 18 2.1.2 Building the project team. 18 2.1.3 Establishing the project goals . 21 2.2 Analyze . 21 2.2.1 Identify business drivers . 21 2.2.2 Define requirements . 23 2.3 Design . 24 2.3.1 Conceptual design . 25 © Copyright IBM Corp. 2011. All rights reserved. iii 2.3.2 Logical design . 25 2.3.3 Physical design . 28 2.4 Configure. 29 2.4.1 Implementation . 29 2.4.2 Configuration. 30 2.5 Deploy . 31 2.5.1 Integration and user acceptance testing . 31 2.5.2 Deploy to production . 31 2.5.3 Validation . 32 2.6 Operate . 32 Chapter 3. Understanding the IBM InfoSphere Optim Data Growth solutions and software . 33 3.1 Traditional archiving . 34 3.2 Optim concepts . 38 3.2.1 The four pillars of Optim-managed data . 42 3.3 Enterprise architecture . 42 3.3.1 Process architecture . 44 3.3.2 Analyze . 45 3.3.3 Design . 46 3.3.4 Deploy and manage . 49 3.3.5 Source. 50 3.3.6 Execute . 52 3.3.7 Target . 62 3.3.8 Provide user access . 64 3.3.9 Storage policy . 71 3.3.10 Security . 73 3.4 Complete business object . 74 3.4.1 Elements of a complete business object. 76 3.4.2 Data-driven processing examples. 82 3.5 Extract, store, and restore processing. 85 3.6 Universal access . 90 Chapter 4. Developing an InfoSphere Optim Data Growth Solution architecture . 93 4.1 Project management . 96 4.1.1 Business goals . 96 4.1.2 Project scope . 96 4.1.3 Project schedule and phasing . 97 4.1.4 Methodology . 98 4.2 Analyze . 99 4.2.1 Requirements . 99 4.2.2 Inventory of assets and technologies . 104 iv Implementing an InfoSphere Optim Data Growth Solution 4.2.3 Standards . 105 4.2.4 Use case models. 106 4.3 Design . 107 4.3.1 Optim components . 107 4.3.2 Software components . 115 4.3.3 Reference deployment models . 117 4.3.4 Extensibility of the deployment models . ..
Load more

Recommended publications
  • Oracle Database Gateway for Adabas User's Guide, 11G Release 2 (11.2) E12074-01
    Oracle® Database Gateway for Adabas User’s Guide 11g Release 2 (11.2) E12074-01 July 2009 Oracle Database Gateway for Adabas User's Guide, 11g Release 2 (11.2) E12074-01 Copyright © 2008, 2009, Oracle and/or its affiliates. All rights reserved. Primary Author: Jeanne Wiegelmann Contributing Author: Maitreyee Chaliha, Sami Zeitoun, Oussama Mkaabal Contributor: Vira Goorah, Peter Wong This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish, or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this software or related documentation is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Government, the following notice is applicable: U.S. GOVERNMENT RIGHTS Programs, software, databases, and related documentation and technical data delivered to U.S. Government customers are "commercial computer software" or "commercial technical data" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental regulations. As such, the use, duplication, disclosure, modification, and adaptation shall be subject to the restrictions and license terms set forth in the applicable Government contract, and, to the extent applicable by the terms of the Government contract, the additional rights set forth in FAR 52.227-19, Commercial Computer Software License (December 2007).
    [Show full text]
  • A Genetic Algorithm for Database Index Selection
    GADIS: A Genetic Algorithm for Database Index Selection Priscilla Neuhaus, Julia Couto, Jonatas Wehrmann, Duncan D. Ruiz and Felipe Meneguzzi School of Technology, PUCRS - Pontifícia Universidade Católica do Rio Grande do Sul - Porto Alegre, Brazil Email: [priscilla.neuhaus, julia.couto, jonatas.wehrmann]@edu.pucrs.br, [duncan.ruiz, felipe.meneguzzi]@pucrs.br Abstract—Creating an optimal amount of indexes, taking optimize the query response time by search for faster index into account query performance and database size remains a configurations when compared to the initial one. challenge. In theory, one can speed up query response by creating We perform a set of experiments using TPC-H, a well indexes on the most used columns, although causing slower data insertion and deletion, and requiring a much larger amount of known database benchmark [11], and we compare our results memory for storing the indexing data, but in practice, it is very with three baseline approaches: (i) the initial index configura- important to balance such a trade-off. This is not a trivial task tion; and (ii) indexes derived from a random-search algorithm. that often requires action from the Database Administrator. We Results show that GADIS outperforms the baselines, allowing address this problem by introducing GADIS, A Genetic Algorithm for better index configuration on the optimized database. for Database Index Selection, designed to automatically select the best configuration of indexes adaptable for any database Finally, we observe that our approach is much more prone schema. This method aims to find the fittest individuals for to find a proper solution that the competitive methods.
    [Show full text]
  • Paper Mainframe
    Club des Responsables d’Infrastructures et de Production IT Infrastructure and Operations IT INFRAsTRucTuRE & Operations MANAgEMENT Best Practices PAPER MAINFRAME IBM zSeries Mainframe Cost Control te i Authors Laurent Buscaylet, Frédéric Didier Bernard Dietisheim, Bruno Koch, Fabrice Vallet sponsored by september 2012 Wh PAgE 2 table of contents INTRODucTION 5 1. “z” POsITIONINg AND Strategy wIThIN A Company 6 1.1 Role of the Mainframe in the eyes of cRIP’s Members 6 1.2 The Position of system z vs. Distributed systems (windows, uNIX, Linux) 6 1.3 system z - Banking/Finance/Insurance vs. general Industry sectors 7 1.4 Evolution strategies for system z 9 2. z Platform OVERVIEw 11 2.1 Technical terms of reference 11 2.1.1 Servers 11 2.1.2 SAN & Networks 12 2.1.3 Storage 13 2.1.4 Backups 15 2.1.5 technical Architecture & Organization 16 2.1.6 Business Continuity 19 2.2 Mainframe software vendors (IsV’s) analysis & positioning 20 2.2.1 the Main Suppliers (ISV’s) 22 2.2.2 the Secondary Suppliers (ISV’s) 22 2.3 survey Results 3. z PLATFORM cOsT cONTROL 28 3.1 controling software cost 28 3.1.1 IBM Contractual Arrangements 28 3.1.2 ISV negotiation strategies: holistic/generic or piecemeal/ad-hoc 31 3.1.3 ISV contractual arrangements: licensing modes & billing 35 3.1.4 MLC: Controlling the billing level 38 3.1.4.1 The IBM billing method 38 3.1.4.2 The problem of smoothing (consolidating) peak loads 41 3.1.4.3 The methods and controls for controlling the software invoice 42 3.1.4.4 Survey feedback and recommendations 43 3.1.4.5 Other Cost Saving Options 48 3.2 Infrastructure cost Reduction 50 3.2.1 Grouping and Sharing Infrastructure 50 3.2.2 Use of specialty engines: zIIP, zAAP, IFL 54 3.3 controlling operational costs 55 3.3.1 Optimization, performance & technical/application component quality 55 3.3.2 Capacity Management, tools & methods 58 4.
    [Show full text]
  • Response Time Analysis on Indexing in Relational Databases and Their Impact
    Response time analysis on indexing in relational databases and their impact Sam Pettersson & Martin Borg 18, June, 2020 Dept. Computer Science & Engineering Blekinge Institute of Technology SE–371 79 Karlskrona, Sweden This thesis is submitted to the Faculty of Computing at Blekinge Institute of Technology in partial fulfillment of the requirements for the bachelor’s degree in software engineering. The thesis is equivalent to 10 weeks of full-time studies. Contact Information: Authors: Martin Borg E-mail: [email protected] Sam Pettersson E-mail: [email protected] University advisor: Associate Professor. Mikael Svahnberg Dept. Computer Science & Engineering Faculty of Computing Internet : www.bth.se Blekinge Institute of Technology Phone : +46 455 38 50 00 SE–371 79 Karlskrona, Sweden Fax : +46 455 38 50 57 Abstract This is a bachelor thesis concerning the response time and CPU effects of indexing in relational databases. Analyzing two popular databases, PostgreSQL and MariaDB with a real-world database structure us- ing randomized entries. The experiment was conducted with Docker and its command-line interface without cached values to ensure fair outcomes. The procedure was done throughout seven different create, read, update and delete queries with multiple volumes of database en- tries to discover their strengths and weaknesses when utilizing indexes. The results indicate that indexing has an overall enhancing effect on almost all of the queries. It is found that join, update and delete op- erations benefits the most from non-clustered indexing. PostgreSQL gains the most from indexes while MariaDB has less of an improvement in the response time reduction.
    [Show full text]
  • Relational Database Index Design
    RReellaattiioonnaall DDaattaabbaassee IInnddeexx DDeessiiggnn Prerequisite for Index Design Workshop Tapio Lahdenmaki April 2004 Copyright Tapio Lahdenmaki, DBTech Pro 1 Relational Database Index Design CHAPTER 1: INTRODUCTION........................................................................................................................4 INADEQUATE INDEXING .......................................................................................................................................4 THE IMPACT OF HARDWARE EVOLUTION ............................................................................................................5 Volatile Columns Should Not Be Indexed – True Or False? ..........................................................................7 Example ..........................................................................................................................................................7 Disk Drive Utilisation.....................................................................................................................................8 SYSTEMATIC INDEX DESIGN ................................................................................................................................9 CHAPTER 2........................................................................................................................................................13 TABLE AND INDEX ORGANIZATION ........................................................................................................13 INTRODUCTION
    [Show full text]
  • IBM DB2 for I Indexing Methods and Strategies Learn How to Use DB2 Indexes to Boost Performance
    IBM DB2 for i indexing methods and strategies Learn how to use DB2 indexes to boost performance Michael Cain Kent Milligan DB2 for i Center of Excellence IBM Systems and Technology Group Lab Services and Training July 2011 © Copyright IBM Corporation, 2011 Table of contents Abstract........................................................................................................................................1 Introduction .................................................................................................................................1 The basics....................................................................................................................................3 Database index introduction .................................................................................................................... 3 DB2 for i indexing technology .................................................................................................................. 4 Radix indexes.................................................................................................................... 4 Encoded vector indexes .................................................................................................... 6 Bitmap indexes - the limitations ....................................................................................................... 6 EVI structure details......................................................................................................................... 7 EVI runtime usage...........................................................................................................................
    [Show full text]
  • Sql Server Index Fragmentation Report
    Sql Server Index Fragmentation Report Reflexive Clayborne miaows, his vibrometer tuck swelled silverly. Improbable Lionello always winches his ironist if Wain is executive or excite incompetently. Cornelius remains noble after Timothy ionizing perceptually or priggings any writes. Fragmentation in DM SQL Diagnostic Manager for SQL Server. Regular indexes rebuild at SQL-Server 200 and higher necessary Posted on Apr 01 2011. This will rejoice you owe determine the upcoming impact should any changes made. You use need to retype it select another editor or in SSMS. Is there something I need to invoke to cause it to be available? Dmf to sql server and reformat them to check index automatically by fragmented, and reorganize operations are. Index operation is not resumable. Httpblogsqlauthoritycom20100112sql-server-fragmentation-detect-fragmentation-and-eli minate-. How to Proactively Gather SQL Server Indexes Fragmentation. Indexes play a vital role in the performance of SQL Server applications Indexes are created on columns in tables or views and objective a quick. DO NOT do this during office hours. Please contact your sql servers that fragmented indexes and reports tab, indexing data published on thresholds to continue browsing experience in one person? Thanks for the code. And server reporting any fragmented indexes optimization was creating storage and easy to report taking into block right on this index for servers are reclaimed on modern frozen meals at that? Just a restore from backup, schools, monitoring and high availability and disaster recovery technologies. Dmdbindexphysicalstats to report fragmentation of bird and indexes for a specified table mountain view Many companies use maintenance plans to work regular.
    [Show full text]
  • Installation for Z/OS
    Natural Installation for z/OS Version 8.2.3 für Großrechner November 2012 Dieses Dokument gilt für Natural ab Version 8.2.3 für Großrechner. Hierin enthaltene Beschreibungen unterliegen Änderungen und Ergänzungen, die in nachfolgenden Release Notes oder Neuausgaben bekanntgegeben werden. Copyright © 1979-2012 Software AG, Darmstadt, Deutschland und/oder Software AG USA, Inc., Reston, VA, Vereinigte Staaten von Amerika, und/oder ihre Lizenzgeber.. Nähere Informationen zu den Patenten und Marken der Software AG und ihrer Tochtergesellschaften befinden sich unter http://documentation.softwareag.com/legal/. Die Nutzung dieser Software unterliegt den Lizenzbedingungen der Software AG. Diese Bedingungen sind Bestandteil der Produkt- dokumentation und befinden sich unter http://documentation.softwareag.com/legal/ und/oder im Wurzelverzeichnis des lizensierten Produkts. Diese Software kann Teile von Drittanbieterprodukten enthalten. Die Hinweise zu den Urheberrechten und Lizenzbedingungen der Drittanbieter entnehmen Sie bitte den "License Texts, Copyright Notices and Disclaimers of Third Party Products". Dieses Dokument ist Bestandteil der Produktdokumentation und befindet sich unter http://documentation.softwareag.com/legal/ und/oder im Wurzelverzeichnis des lizensierten Produkts. Dokument-ID: NATMF-INSTALL-ZOS-823-20121108 Table of Contents Preface ............................................................................................................................... ix I Installation Process and Major Natural Features on z/OS ..............................................
    [Show full text]
  • Database Performance on AIX in DB2 UDB and Oracle Environments
    Database Performance on AIX in DB2 UDB and Oracle Environments Nigel Griffiths, James Chandler, João Marcos Costa de Souza, Gerhard Müller, Diana Gfroerer International Technical Support Organization www.redbooks.ibm.com SG24-5511-00 SG24-5511-00 International Technical Support Organization Database Performance on AIX in DB2 UDB and Oracle Environments December 1999 Take Note! Before using this information and the product it supports, be sure to read the general information in Appendix E, “Special notices” on page 411. First Edition (December 1999) This edition applies to Version 6.1 of DB2 Universal Database - Enterprise Edition, referred to as DB2 UDB; Version 7 of Oracle Enterprise Edition and Release 8.1.5 of Oracle8i Enterprise Edition, referred to as Oracle; for use with AIX Version 4.3.3. Comments may be addressed to: IBM Corporation, International Technical Support Organization Dept. JN9B Building 003 Internal Zip 2834 11400 Burnet Road Austin, Texas 78758-3493 When you send information to IBM, you grant IBM a non-exclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. © Copyright International Business Machines Corporation 1999. All rights reserved. Note to U.S Government Users – Documentation related to restricted rights – Use, duplication or disclosure is subject to restrictions set forth in GSA ADP Schedule Contract with IBM Corp. Contents Preface...................................................xv How this book is organized .......................................xv The team that wrote this redbook. ..................................xvi Commentswelcome.............................................xix Chapter 1. Introduction to this redbook .........................1 Part 1. RDBMS concepts .................................................3 Chapter 2. Introduction into relational database system concepts....5 2.1WhatisanRDBMS?.......................................5 2.2 What does an RDBMS provide? .
    [Show full text]
  • Online Identity in the Case of the Share Phenomenon. a Glimpse Into the on Lives of Romanian Millennials
    Online identity in the case of the share phenomenon. A glimpse into the on lives of Romanian millennials Demetra GARBAȘEVSCHI PhD Student National University of Political Science and Public Administration E-Mail: [email protected] Abstract. In less than a decade, the World Wide Web has evolved from a predominantly search medium to a predominantly share medium, from holding a functional role to being endowed with a social one.In the context of a reontologisation of the infosphere and of an unprecedented display of mass self-communication, the identity system has gained a legitimate dimension – online identity –, as individuals have become the sum of impressions openly offered online and decoded into a coherent story by the receiver. In the network society, there are consequences to both having and not having an online identity. Originating in an interactionist perspective, the present paper looks into Romanian Millennials in trying to find out whether online identity is undergoing a process of intentionalization, in other words whether it becomes a conscious, planned effort of the individual to build himself/ herself a legitimate and profitable dimension in the digital space. Keywords: online identity; infosphere; mass self-communication; Millennials; Generation Y. 1. Introduction and theoretical background This paper examines online identity as part of an individual’s identity system, in the specific context of current Internet development, generalized connectivity Journal of Media Research, Vol. 8 Issue 2(22) / 2015,14 pp. 14-26 and participation through the share web. The discussion centers on Romanian young adults, seeking to uncover their perceptions of online identity as a potentially strategic self-representation process.
    [Show full text]
  • A Fast, Yet Lightweight, Indexing Scheme for Modern Database Systems
    Two Birds, One Stone: A Fast, yet Lightweight, Indexing Scheme for Modern Database Systems 1Jia Yu 2Mohamed Sarwat School of Computing, Informatics, and Decision Systems Engineering Arizona State University, 699 S. Mill Avenue, Tempe, AZ [email protected], [email protected] ABSTRACT Table 1: Index overhead and storage dollar cost Classic database indexes (e.g., B+-Tree), though speed up + queries, suffer from two main drawbacks: (1) An index usu- (a) B -Tree overhead ally yields 5% to 15% additional storage overhead which re- TPC-H Index size Initialization time Insertion time sults in non-ignorable dollar cost in big data scenarios espe- 2GB 0.25 GB 30 sec 10 sec cially when deployed on modern storage devices. (2) Main- 20 GB 2.51 GB 500 sec 1180 sec taining an index incurs high latency because the DBMS has 200 GB 25 GB 8000 sec 42000 sec to locate and update those index pages affected by the un- derlying table changes. This paper proposes Hippo a fast, (b) Storage dollar cost yet scalable, database indexing approach. It significantly HDD EnterpriseHDD SSD EnterpriseSSD shrinks the index storage and mitigates maintenance over- 0.04 $/GB 0.1 $/GB 0.5 $/GB 1.4 $/GB head without compromising much on the query execution performance. Hippo stores disk page ranges instead of tuple pointers in the indexed table to reduce the storage space oc- table. Even though classic database indexes improve the cupied by the index. It maintains simplified histograms that query response time, they face the following challenges: represent the data distribution and adopts a page group- ing technique that groups contiguous pages into page ranges • Indexing Overhead: Adatabaseindexusually based on the similarity of their index key attribute distri- yields 5% to 15% additional storage overhead.
    [Show full text]
  • Storming the Reality Studio
    DRAFT Storming the Reality Studio: Leveraging Public Information in the War on Terror Brendan Matthew-Gordon Kelly Prepared for the 47th Annual International Studies Association Convention March 22-25, 2006 San Diego, CA Abstract This paper ar gues that the war on terror is understood on both sides as an idea war, an event that signifies the triumph of Constructivist theories over strictly Realist interpretations of international politics. It further argues that this is a watershed event, in which information operations have finally taken a primary role in military strategy. Finally, it argues that this is most visible in cyberspace. On February 17th, Defense Secretary Donald Rumsfeld spoke before the Council on Foreign Relations to argue that America was losing the information war in its struggle against radical Islam: Rumsfeld also said al-Qaida and other Islamic extremist groups have poisoned the Muslim public's view of the United States through deft use of the Internet and other modern communications methods that the American government has failed to master. "Our enemies have skillfully adapted to fighting wars in today's media age, but for the most part we - our country, our government - has not adapted," he said. 1 This argument is problematic for several reasons. First, it fails to consider the possibility that the Muslim world’s “poisoned” view of the United States has nothing to do with Al-Qaeda or other extremist organizations.2 But even if we accept Rumsfeld’s argument at face value, these statements are still problematic. The fact is that America, the home of Hollywood and Madison Avenue, has dominated the art of political spin for decades.
    [Show full text]