Optimized Data Indexing Algorithms for OLAP Systems


 Florence Potter
 2 years ago
 Views:
Transcription
1 Database Systems Journal vol. I, no. 2/200 7 Optimized Data Indexing Algoritms for OLAP Systems Lucian BORNAZ Faculty of Cybernetics, Statistics and Economic Informatics Academy of Economic Studies, Bucarest Te need to process and analyze large data volumes, as well as to convey te information contained terein to decision makers naturally led to te development of OLAP systems. Similarly to SGBDs, OLAP systems must ensure optimum access to te storage environment. Altoug tere are several ways to optimize database systems, implementing a correct data indexing solution is te most effective and less costly. Tus, OLAP uses indexing algoritms for relational data and ndimensional summarized data stored in cubes. Today database systems implement derived indexing algoritms based on wellknown Tree, Bitmap and Has indexing algoritms. Tis is because no indexing algoritm provides te best performance for any particular situation (type, structure, data volume, application). Tis paper presents a new ndimensional cube indexing algoritm, derived from te well known BTree index, wic indexes data stored in data wareouses taking in consideration teir multidimensional nature and provides better performance in comparison to te already implemented Treelike index types. Keywords: data wareouse; indexing algoritm; OLAP, ntree. Introduction Data wareouses represented a natural solution towards increasing te availability of data and information, as well as teir accessibility to decision makers. Te wareouses store important data coming from different sources for later processing and are an integrant part of analytical processing systems (OLAP). Unlike OLTP systems, OLAP systems must execute complex interrogations and large data volume analyses. To optimize, analytical processing systems analyze data and store aggregated information in special analytic structures, called cubes. Similarly to OLTP systems, OLAP systems use indexing algoritms to optimize access to data stored in data wareouses, i.e. cubes. 2. General information about cubes Wen stored in an OLAP system, te source data may be indexed to reduce te time necessary for teir processing. To index source data, OLAP systems use indexing algoritms similar to OLTP (BTree, Bitmap, RTree etc.). Processed data are stored in ndimensional structures called cubes. Te elements of a cube are te dimensions, members, cells, ierarcies and properties [] (fig. ).
2 8 Optimized Data Indexing Algoritms for OLAP Systems Dimension z Cel y 0 x Fig.  Structure of a tridimensional cube Te dimensions contain descriptive information about te data tat is to be summarized. Tey are essential for data analysis and represent an axis of te cube [2]. Eac dimension corresponds to a measure of te data source and uniquely contains eac value stored in tat position. During queries, te dimensions are used to reduce te searc area and usually occur in te WHERE clause. Hierarcies describe te ierarcical relationsips between two or more members of te same dimension. A dimension can be part of multiple ierarcies. For example, in addition to te ierarcy of dimensions QuarterMontYear, Time dimension can belong to te ierarcy DayMontYear. Te cells of te cube contain summarized data based on dimensions values. Cells store summarized data based on te cube dimension number, dimensions values, metod of analysis and is usually, te result returned by te queries. Properties describe common features of all members of te same dimension. Properties allow selecting data based on similar caracteristics. For example, te size of product volume may ave an attribute wic allows a certain volume products. Analysis and data processing is based on te metod cosen. Te same data can be analyzed using different metods (clustering, neural nets, regression, Bayesian, Decision trees, etc.) accordingly to te user's needs. Altoug using different metods of analysis may result in different aggregate data and ordering different logic cells, te logical structure of te cube is te same. In order to optimize performance, OLAP systems implement cube indexing algoritms. Te indexes created troug tis process use te data contained in a cube s dimensions to quickly access te cells containing te data required by te user. Hence, cubes are indexed using a B Tree type of algoritm. 3. Te BTree Index in OLAP Systems As te values of te cube dimensions are unique and tey are stored in te index blocks and used to locate te leaf blocks wic contain references to te pysical location of te cube cells, implementing a B Tree index represents an effective solution for indexing cubes. A BTree index used in OLAP systems contains subtrees corresponding to eac dimension. Te subtrees are connected in suc a way tat eac pat to go troug te tree from te root node to te final level index blocks (te ones storing te references to te cube s cells) is crossed by a subtree corresponding to eac dimension. Tus, a tree dimensional cube contains tree levels. Te first level represents a matrix of planes (bidimensional space), te second level represents a matrix of lines (one dimensional space), and te tird level represents a matrix of points in space (0 dimensional space) (fig. 2).
3 Database Systems Journal vol. I, no. 2/200 9 Level Level 2 Level 3 Storage Root Nod Cube cells Dimension X Dimension Y Dimension Z Fig. 2  Te structure of a BTree index for a treedimensional cube [3] Tus, eac cube size will correspond to one subtree of te BTree index and eac subtree will ave on cild subtree for eac cild dimension. Summarized data are stored inside te cube, on pages separate from te cells. As summarized data creation and storage consumes CPU resources and storage space environment, te developer and/or system administrator can coose as tey are available only at certain levels, depending on teir usage, summarized data obtained from te upper levels being calculated by processing te data summarized in te lower levels. Looking at te structure of te BTree index, it is easily noticeable tat te cost of locating one of te cube s cells represents te sum of te costs associated wit locating te last level index block of eac subtree. Te eigt of suc an index is (f.) [4]: r + logd (f.) 2 were N, d is te number of stored values witin an index block, r is te total number of values corresponding to te dimension. Te number of index blocks of a subtree containing d elements is: d l d = l= 0 2d were d=(m) and is te tree eigt. (f.2) Considering tat te number of items stored in index blocks at te top level of te subtree is r, we can calculate te maximum eigt () of te index portion corresponding to a specific dimension, as follows: 2d( d ) r d => 2 d r + r + logd 2 (f.3) => were N.
4 20 Optimized Data Indexing Algoritms for OLAP Systems Te total cost of a searc operation witin a subtree is: N si =+E a +E b +2E a E b (f.7) c i =+ (f.4) Since to locate a cell of te cube is necessary to cross every subtree, corresponding to eac dimension of te cube, we can calculate te total cost of a queries based on (f.4): n = cti cij + ( d ) (f.5) j= were n is te number of cube dimensions, c ij is te cost of query subtree corresponding to te dimension j and d is te total number of root nodes used as connecting elements of te leaf blocks of subtrees tat ave several subordinated subtree. Since OLAP systems incorporate very large data volumes, teir performance is affected not only by te query operations cost but also by te index storage space. Indexes tend to occupy te storage space of te cube and sometimes teir size can be larger tan te data stored in te cube. If an index occupies a large memory space, it means tat te structure is ig (number of elements, elements tat store too muc data, etc.), wic increases te index creation time and query execution times. Using formulas (f.2) and (f.3) it can be calculated te storage space (SS) for a subtree indexed using a BTree index: S s d = S 2d p (f.6) were d is te number of items stored in a block index, is te index eigt and SS is te page size. Total storage space (St) needed to store a BTree index used for indexing cubes is equal to storage space for all its subtrees. For a cube wit tree dimensions, te number of subtrees of a BTree index is: were N si is te number of subtrees of dimension i, E a and E b represents te elements number of dimension index leaf block corresponding to te oter two dimensions. Based on te (f.2)(f.7), wole BTree index size can be calculated as: S t = j ( Ssi Nsi ) i= +S rn (f.8) were j is te cube dimensions number, S si is a storage space needed to store te subtree for te dimension i, te N si is te number of subtrees coresponding to te dimension i and S rn is te size of all nodes connecting te subtrees. Te query cost of te BTree index is te sum of te cost of all subtrees between te root node and te index leaf block wic store te pysical address of te cell. 4. Te ntree Indexing Algoritm Given te caracteristics of cubes, as well as te structure of a BTree index, it becomes obvious tat tis indexing algoritm is not optimized for ndimensional data structures. Tus, te number of subtrees witin te index is directly proportional wit te number of dimensions. As a consequence, te cube is overindexed resulting in an overconsumption of processing time and storage space. Te proposed ndimensional indexing algoritm pays attention to te n dimensional structure of te data. Instead of creating subtrees corresponding to eac dimension and subsequently linking tem, it creates only one tree wic indexes data simultaneously on all dimensions. As a result, te ndimensional space is gradually divided into ever smaller ndimensional subdivisions, until te smallest subdivisions represent te cells of te cube. Te resulting index as te following caracteristics:
5 Database Systems Journal vol. I, no. 2/ no NULL values are indexed;  te root node contains at least two subordinated index blocks if it does not coincide wit te last level index block;  eac index block contains:  values from eac dimension of te cube; te combination of suc values represents a reference point in te n dimensional space; Te index maintains an ordered list containing unique values corresponding to eac dimension of te cube. Te values in eac list represent a subgroup of te values of te respective dimension. Combining values from eac list at a time, we can obtain te data needed to identify te reference points in te ndimensional space simultaneously minimizing te space required to store tem. Any value corresponding to a dimension from te subordinated index block is smaller tan te value of te respective dimension corresponding to te reference point from te upper level index block.  references to te subordinated index blocks (r bs ), corresponding to te reference points (f.9): n r bs = a i i= (f.9) were a..n represents te number of values from dimensions..n stored in te index block;  n references to te index blocks tat contain larger values in a dimension tan te reference point (one for eac dimension). Tus, an index block contains a total of r references (f.0): r=r bs +n (f.0) were n equals te number of te cube s dimensions.  te last level index blocks do not contain any references to oter index blocks; instead tey store te reference to te pysical location of te cube s cells;  te pysical size of an index block is approximately one page. Eac index block stores an ordered list of unique values corresponding to eac cube dimensions. Values from eac list is a subset of tese dimensions. Combining values from eac list, one by one, points from te n dimensional space can be identified, minimizing te needed storage space. Any value from te dimensions, stored into an index block, is lower tan te value belonging to te respective dimension from te reference point of te iger rank index block. Fig. 3  Te structure of an n dimensional index corresponding to a tree dimensional cube Because te dimensions values of te reference point are uniquely stored, te n dimensional space is always a regular space. For a cube wit tree dimensions, tis space is a rectangular parallelepiped, and ideally is a cube. If some cells do not contain data units (containing null values), tey are not indexed, tus reducing te size of te index. Te lack of aggregated values corresponding to a cell does not affect te form of te space described by te values stored into a index block. Every ntree index contains a subtree tat indexes te summarized data wic as te following caracteristics:  it contains a subtree for eac dimension of te cube;
6 22 Optimized Data Indexing Algoritms for OLAP Systems  eac subtree corresponding to a dimension as a structure similar to a B Tree index and indexes all te values pertaining to te respective dimension;  te index blocks of te subtrees contain references to te lower level index blocks;  te index leaf blocks do not contain references to oter indexing blocks; instead tey are te sole elements containing references to te pages were te summarized data are stored;  eac element of te index leaf blocks contains references to parts of te n dimensional space to wic te respective value is assigned Subtree wic indexes te cube cells Subtree wic indexes te cells wic stores te summarized data Storage Root node Cell Summarized data References (pointers) Dimension X Dimension Y Dimension Z References to te summarized data Fig. 4  Te structure of an ntree index for to a tree dimensional cube Tus te number of referenced contained by eac element of a leaf index block is: rs=n (f.) were n is equal to te number of te cube s dimensions. Summarized data relating to eac value stored in te subtree corresponding to one dimension are equivalent to a to (n) dimensional subspace. Te subspaces are distributed among te respective subtrees, as to avoid storing multiple references to te same summarized data. Te dimensions of te index are tus reduced. For a 3dimensional cube, te index leaf blocks will contain te following references:  te elements of te index leaf block of te X dimension subtree contain:  references to data summarized te value of te X dimension, all values of te Y dimension and te first value of te Z dimension (one dimensional space);  references to te data summarized te value of te X dimension, all values of te Y dimensions and all values of te Z dimension (two dimensional space)  te elements of te index leaf blocks of te subtree corresponding to te Y dimension contain:  references to te data summarized te value of te Y dimension, all values of te Z dimension and te first value of te X dimension (one dimensional space);  references to te data summarized te value of te Y dimension, all values of te X dimension and all te values of
7 Database Systems Journal vol. I, no. 2/ te Z dimensions (two dimensional space);  te elements of te index leaf blocks of te subtree corresponding to te Z dimension contain:  references to te data summarized te value of te Z dimension, all values of te X dimension and te first value of te Y dimension (one dimensional space);  references to data summarized te value of te Z dimension, all values of te X dimensions and all values of te Y dimension (two dimensional space). 5. Creating an ntree Index To create an ndimensional index, all data in every index is read and ndimensional points are created. For eac of tese points, te following operations are carried out:  an index block corresponding to an n dimensional subspace wose reference point as only values larger tan tat of te processed point is identified; te index block must also ave enoug free space to store te values of te corresponding dimensions of te processed point plus a reference; If suc an index block is identified, te values are added to te dimensions corresponding lists and te reference to te pysical location of te cube s cell is stored. Oterwise, a new index block is created by dividing one of te neigboring index blocks.  wen a new index block is created, te values of te reference point, as well as te reference to te parent index block are added, togeter wit references to te neigboring index blocks; S e = j i= S vi + S ref (f.2) were S e is te element size, S vi is te data type size for te dimension i and S ref is te size of a reference. Tis process could propagate itself to te root node. Generally, OLAP systems contain istorical data wit a low frequency of updating operations but wit a large volume of updates. Updating tese data also triggers an updating of te cube, and tus, of its index. It sould be noted tat te space required for inserting a new element into a block index is not always te same. If some values of ndimensional point corresponding to a specific dimension were previously inserted te necessary free space is smaller tan te element size. 6. Te Performance of te ntree Index Te performance of an index depends on its eigt. A larger eigt means more pysical read operations are needed to identify te cell containing te required data. Te eigt of te index depends on te size of te index block, te size of te type of indexed data, te number of references to subordinated index blocks stored in eac index block, and te number of cells. By analyzing te structure of an index block (fig. 4), we can compute te number of references it can store. Fig. 5  Structure of an index block in an n Tree index Te volume of te stored data in an index block may be written as (f.): S D... D a D D D a... D D n D n D n..... D n... D n z D... D n... D... D n z D... D n... D... D n z D a... D n... D a... D n z... n n d = a i i Sv + = i= D n ai + n S ref Values Pointers to te lowest index blocks Pointers to te neigboring index blocks (f.3)
8 24 Optimized Data Indexing Algoritms for OLAP Systems were S d represents te volume of te stored data, S v represents te size of te indexed value, n is te number of dimensions and S ref te size of a reference. Te blocks number of te ntree index wic contains d elements is: d l d = l= 0 2d were is te index eigt. (f.4) Fig. 6  Te cost of a searc operation in a twodimensional cube Ideally, d is te maximum number of te elements wic can be stored inside an n Tree index and its value is up to a i + n. n i= Te query cost for te ntree index is: c i =+ (f.5) were c i is te query cost, is te index eigt and is for te index root block. Since te data in an OLAP system is rarely modified, te best performance is obtained wen te index blocks contain a volume of data equal to teir size. Terefore, we can approximate te value of S d to be equal to tat of a page. We assume tat:  te size of an index block is of 8kB (tis is te most common size in current database systems [5]);  te size of a reference is 6B (te most common size for a local index [6]);  te size of te data type is 8B (tis is te size of te datetime type of data);  eac dimension contains te same number of unique values. Using te formulas (f.3) and (f.5), we can compare te performance of a ntree index to tat of a BTree index (fig 6). Fig. 7  Te cost of a searc operation in a tree dimensional cube Analyzing fig. 6 and fig 7, it can be seen tat te ntree index query cost is lower te te BTree index query cost event for.000 cells. Te performance difference is event iger wen te cells number or te dimensions number increase. Fig. 8  Te size [in MB] of an index corresponding to a two dimensional cube
9 Database Systems Journal vol. I, no. 2/ Anyway, in fig. 0 and fig. it can be observed tat te ntree index query cost is lower tan te BTree index query cost in any situation, excepting wen te cells number is very low. Fig. 9  Te size [in MB] of an index corresponding to a tree dimensional cube Te same situation can be observed for te index size in fig. 8 and fig. 9. Te ntree index is muc smaller tan te BTree index. Te difference comes from te lower number of te index blocks and from te flexibility of creating te summarized data. Wen te data summarized data is to be query, te result depends on te location of te location of te summarized data. Fig. 0  Te summarized data query cost for a twodimensional cube Fig.  Te summarized data query cost for a treedimensional cube 7. Conclusions Implementing a new indexing algoritm, wit muc wider scope and increased flexibility, could be te database systems optimization solution, especially wen oter indexing algoritms do not provide te desired results. Te ntree index could be considered a more generalized Btree index. If BTree index can index only unidimesional data, te ntree index is optimized for any n dimensional data. Moreover, te ntree index will be more suitable for indexing spatial data. As sown in figures 59, te ntree index outperforms te BTree index in locating te cells of te cube. Moreover, te difference in performance increases as te number of te cube s cells rises. In addition, te space occupied by te ntree index in muc smaller tan tat needed for a BTree index. Again te superiority of te ntree index is all te more evident wen te number of te cube s cells increases. References [] Revista Informatica Economica, nr. 4 (24), 2002; [2] Revista Informatica Economica, nr. (7), 200; [3] Computing Partial Data Cubes for Parallel Data Wareousing Applications, Frank Dene, Andrew Raucaplin, Computational Science  ICCS 200; [4] Ubiquitous BTree, Douglas Corner, ACM, 979; [5] MCTS 7043: Implementing and Maintaining Microsoft SQL Server 2005, Que, 2006; [6] Index Internals, Julian Dyke, 2005.
10 26 Optimized Data Indexing Algoritms for OLAP Systems Lucian Bornaz is PD candidate at Academy of Economic Studies since His researc domain is database systems wit focus on data indexing algoritms. He graduated Airforce Academy in 998 and master course at Academy of Economic Studies in Lucian Bornaz is certified by Microsoft as MCP, MCSA, MCSE, MCDBA, MCAD and MCTS.
M(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1)
Insertion and Deletion in VL Trees Submitted in Partial Fulfillment of te Requirements for Dr. Eric Kaltofen s 66621: nalysis of lgoritms by Robert McCloskey December 14, 1984 1 ackground ccording to Knut
More informationResearch on the Antiperspective Correction Algorithm of QR Barcode
Researc on te Antiperspective Correction Algoritm of QR Barcode Jianua Li, YiWen Wang, YiJun Wang,Yi Cen, Guoceng Wang Key Laboratory of Electronic Tin Films and Integrated Devices University of Electronic
More informationVerifying Numerical Convergence Rates
1 Order of accuracy Verifying Numerical Convergence Rates We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, suc as te grid size or time step, and
More informationSchedulability Analysis under Graph Routing in WirelessHART Networks
Scedulability Analysis under Grap Routing in WirelessHART Networks Abusayeed Saifulla, Dolvara Gunatilaka, Paras Tiwari, Mo Sa, Cenyang Lu, Bo Li Cengjie Wu, and Yixin Cen Department of Computer Science,
More informationOverview of Component Search System SPARSJ
Overview of omponent Searc System Tetsuo Yamamoto*,Makoto Matsusita**, Katsuro Inoue** *Japan Science and Tecnology gency **Osaka University ac part nalysis part xperiment onclusion and Future work Motivation
More informationOptimal Pricing Strategy for Second Degree Price Discrimination
Optimal Pricing Strategy for Second Degree Price Discrimination Alex O Brien May 5, 2005 Abstract Second Degree price discrimination is a coupon strategy tat allows all consumers access to te coupon. Purcases
More informationThis supplement is meant to be read after Venema s Section 9.2. Throughout this section, we assume all nine axioms of Euclidean geometry.
Mat 444/445 Geometry for Teacers Summer 2008 Supplement : Similar Triangles Tis supplement is meant to be read after Venema s Section 9.2. Trougout tis section, we assume all nine axioms of uclidean geometry.
More informationComparison between two approaches to overload control in a Real Server: local or hybrid solutions?
Comparison between two approaces to overload control in a Real Server: local or ybrid solutions? S. Montagna and M. Pignolo Researc and Development Italtel S.p.A. Settimo Milanese, ITALY Abstract Tis wor
More informationTrapezoid Rule. y 2. y L
Trapezoid Rule and Simpson s Rule c 2002, 2008, 200 Donald Kreider and Dwigt Lar Trapezoid Rule Many applications of calculus involve definite integrals. If we can find an antiderivative for te integrand,
More informationModule 1: Introduction to Finite Element Analysis Lecture 1: Introduction
Module : Introduction to Finite Element Analysis Lecture : Introduction.. Introduction Te Finite Element Metod (FEM) is a numerical tecnique to find approximate solutions of partial differential equations.
More information2.28 EDGE Program. Introduction
Introduction Te Economic Diversification and Growt Enterprises Act became effective on 1 January 1995. Te creation of tis Act was to encourage new businesses to start or expand in Newfoundland and Labrador.
More information2 Limits and Derivatives
2 Limits and Derivatives 2.7 Tangent Lines, Velocity, and Derivatives A tangent line to a circle is a line tat intersects te circle at exactly one point. We would like to take tis idea of tangent line
More informationGeometric Stratification of Accounting Data
Stratification of Accounting Data Patricia Gunning * Jane Mary Horgan ** William Yancey *** Abstract: We suggest a new procedure for defining te boundaries of te strata in igly skewed populations, usual
More informationSAMPLE DESIGN FOR THE TERRORISM RISK INSURANCE PROGRAM SURVEY
ASA Section on Survey Researc Metods SAMPLE DESIG FOR TE TERRORISM RISK ISURACE PROGRAM SURVEY G. ussain Coudry, Westat; Mats yfjäll, Statisticon; and Marianne Winglee, Westat G. ussain Coudry, Westat,
More informationME422 Mechanical Control Systems Modeling Fluid Systems
Cal Poly San Luis Obispo Mecanical Engineering ME422 Mecanical Control Systems Modeling Fluid Systems Owen/Ridgely, last update Mar 2003 Te dynamic euations for fluid flow are very similar to te dynamic
More informationThe EOQ Inventory Formula
Te EOQ Inventory Formula James M. Cargal Matematics Department Troy University Montgomery Campus A basic problem for businesses and manufacturers is, wen ordering supplies, to determine wat quantity of
More informationWhat is Advanced Corporate Finance? What is finance? What is Corporate Finance? Deciding how to optimally manage a firm s assets and liabilities.
Wat is? Spring 2008 Note: Slides are on te web Wat is finance? Deciding ow to optimally manage a firm s assets and liabilities. Managing te costs and benefits associated wit te timing of cas in and outflows
More informationSAT Subject Math Level 1 Facts & Formulas
Numbers, Sequences, Factors Integers:..., 3, 2, 1, 0, 1, 2, 3,... Reals: integers plus fractions, decimals, and irrationals ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences: PEMDAS (Parenteses
More informationA system to monitor the quality of automated coding of textual answers to open questions
Researc in Official Statistics Number 2/2001 A system to monitor te quality of automated coding of textual answers to open questions Stefania Maccia * and Marcello D Orazio ** Italian National Statistical
More informationFINITE DIFFERENCE METHODS
FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to
More information 1  Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz
CS106B Spring 01 Handout # May 3, 01 Huffman Encoding and Data Compression Handout by Julie Zelenski wit minor edits by Keit Scwarz In te early 1980s, personal computers ad ard disks tat were no larger
More informationCharacterization of researchers in condensed matter physics using simple quantity based on h index. M. A. Pustovoit
Caracterization of researcers in condensed matter pysics using simple quantity based on index M. A. Pustovoit Petersburg Nuclear Pysics Institute, Gatcina Leningrad district 188300 Russia Analysis of
More informationFinite Difference Approximations
Capter Finite Difference Approximations Our goal is to approximate solutions to differential equations, i.e., to find a function (or some discrete approximation to tis function) tat satisfies a given relationsip
More informationHaptic Manipulation of Virtual Materials for Medical Application
Haptic Manipulation of Virtual Materials for Medical Application HIDETOSHI WAKAMATSU, SATORU HONMA Graduate Scool of Healt Care Sciences Tokyo Medical and Dental University, JAPAN wakamatsu.bse@tmd.ac.jp
More informationA STUDY ON NUMERICAL COMPUTATION OF POTENTIAL DISTRIBUTION AROUND A GROUNDING ROD DRIVEN IN SOIL
A STUDY ON NUMERICAL COMPUTATION OF POTENTIAL DISTRIBUTION AROUND A GROUNDING ROD DRIVEN IN SOIL Ersan Şentürk 1 Nurettin Umurkan Özcan Kalenderli 3 email: ersan.senturk@turkcell.com.tr email: umurkan@yildiz.edu.tr
More informationAnalysis of Algorithms  Recurrences (cont.) 
Analysis of Algoritms  Recurrences (cont.)  Andreas Ermedal MRTC (Mälardalens Real Time Researc Center) andreas.ermedal@md.se Autumn 004 Recurrences: Reersal Recurrences appear frequently in running
More informationLecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function
Lecture 10: Wat is a Function, definition, piecewise defined functions, difference quotient, domain of a function A function arises wen one quantity depends on anoter. Many everyday relationsips between
More informationA strong credit score can help you score a lower rate on a mortgage
NET GAIN Scoring points for your financial future AS SEEN IN USA TODAY S MONEY SECTION, JULY 3, 2007 A strong credit score can elp you score a lower rate on a mortgage By Sandra Block Sales of existing
More informationOn a Satellite Coverage
I. INTRODUCTION On a Satellite Coverage Problem DANNY T. CHI Kodak Berkeley Researc Yu T. su National Ciao Tbng University Te eart coverage area for a satellite in an Eart syncronous orbit wit a nonzero
More informationCan a LumpSum Transfer Make Everyone Enjoy the Gains. from Free Trade?
Can a LumpSum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lumpsum transfer rules to redistribute te
More informationThe modelling of business rules for dashboard reporting using mutual information
8 t World IMACS / MODSIM Congress, Cairns, Australia 37 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,
More information7.6 Complex Fractions
Section 7.6 Comple Fractions 695 7.6 Comple Fractions In tis section we learn ow to simplify wat are called comple fractions, an eample of wic follows. 2 + 3 Note tat bot te numerator and denominator are
More informationDerivatives Math 120 Calculus I D Joyce, Fall 2013
Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te
More information2.23 Gambling Rehabilitation Services. Introduction
2.23 Gambling Reabilitation Services Introduction Figure 1 Since 1995 provincial revenues from gambling activities ave increased over 56% from $69.2 million in 1995 to $108 million in 2004. Te majority
More informationLet's Learn About Notes
2002 Product of Australia Contents Let's Learn About Notes by Beatrice Wilder Seet Seet 2 Seet 3 Seet 4 Seet 5 Seet 6 Seet 7 Seet 8 Seet 9 Seet 0 Seet Seet 2 Seet 3 Basic Information About Notes Lines
More informationAreaSpecific Recreation Use Estimation Using the National Visitor Use Monitoring Program Data
United States Department of Agriculture Forest Service Pacific Nortwest Researc Station Researc Note PNWRN557 July 2007 AreaSpecific Recreation Use Estimation Using te National Visitor Use Monitoring
More informationA New Hybrid Metaheuristic Approach for Stratified Sampling
A New Hybrid Metaeuristic Approac for Stratified Sampling Timur KESKİNTÜRK 1, Sultan KUZU 2, Baadır F. YILDIRIM 3 1 Scool of Business, İstanbul University, İstanbul, Turkey 2 Scool of Business, İstanbul
More information13 PERIMETER AND AREA OF 2D SHAPES
13 PERIMETER AND AREA OF D SHAPES 13.1 You can find te perimeter of sapes Key Points Te perimeter of a twodimensional (D) sape is te total distance around te edge of te sape. l To work out te perimeter
More informationOPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS
OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS ERIC T. CHUNG AND BJÖRN ENGQUIST Abstract. In tis paper, we developed and analyzed a new class of discontinuous
More informationNote nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1
Copyrigt c Sanjoy Dasgupta Figure. (a) Te feasible region for a linear program wit two variables (see tet for details). (b) Contour lines of te objective function: for different values of (profit). Te
More informationModule 2. The Science of Surface and Ground Water. Version 2 CE IIT, Kharagpur
Module Te Science of Surface and Ground Water Version CE IIT, Karagpur Lesson 6 Principles of Ground Water Flow Version CE IIT, Karagpur Instructional Objectives On completion of te lesson, te student
More informationInvestigating CostEfficient Ways of Running a Survey of Pacific Peoples. Undertaken for the Ministry of Pacific Island Affairs
Investigating CostEfficient Ways of Running a Survey of Pacific Peoples Undertaken for te Ministry of Pacific Island Affairs by Temaleti Tupou, assisted by Debra Taylor and Tracey Savage Survey Metods,
More informationBinary Search Trees. Adnan Aziz. Heaps can perform extractmax, insert efficiently O(log n) worst case
Binary Searc Trees Adnan Aziz 1 BST basics Based on CLRS, C 12. Motivation: Heaps can perform extractmax, insert efficiently O(log n) worst case Has tables can perform insert, delete, lookup efficiently
More informationAn inquiry into the multiplier process in ISLM model
An inquiry into te multiplier process in ISLM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 0062763074 Internet Address: jefferson@water.pu.edu.cn
More informationTangent Lines and Rates of Change
Tangent Lines and Rates of Cange 922005 Given a function y = f(x), ow do you find te slope of te tangent line to te grap at te point P(a, f(a))? (I m tinking of te tangent line as a line tat just skims
More informationInstantaneous Rate of Change:
Instantaneous Rate of Cange: Last section we discovered tat te average rate of cange in F(x) can also be interpreted as te slope of a scant line. Te average rate of cange involves te cange in F(x) over
More informationStrategic trading in a dynamic noisy market. Dimitri Vayanos
LSE Researc Online Article (refereed) Strategic trading in a dynamic noisy market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt and Moral
More informationThe differential amplifier
DiffAmp.doc 1 Te differential amplifier Te emitter coupled differential amplifier output is V o = A d V d + A c V C Were V d = V 1 V 2 and V C = (V 1 + V 2 ) / 2 In te ideal differential amplifier A c
More informationPressure. Pressure. Atmospheric pressure. Conceptual example 1: Blood pressure. Pressure is force per unit area:
Pressure Pressure is force per unit area: F P = A Pressure Te direction of te force exerted on an object by a fluid is toward te object and perpendicular to its surface. At a microscopic level, te force
More informationDesign and Analysis of a FaultTolerant Mechanism for a ServerLess VideoOnDemand System
Design and Analysis of a Faultolerant Mecanism for a ServerLess VideoOnDemand System Jack Y. B. Lee Department of Information Engineering e Cinese University of Hong Kong Satin, N.., Hong Kong Email:
More informationACTIVITY: Deriving the Area Formula of a Trapezoid
4.3 Areas of Trapezoids a trapezoid? How can you derive a formula for te area of ACTIVITY: Deriving te Area Formula of a Trapezoid Work wit a partner. Use a piece of centimeter grid paper. a. Draw any
More informationCatalogue no. 12001XIE. Survey Methodology. December 2004
Catalogue no. 1001XIE Survey Metodology December 004 How to obtain more information Specific inquiries about tis product and related statistics or services sould be directed to: Business Survey Metods
More informationWe consider the problem of determining (for a short lifecycle) retail product initial and
Optimizing Inventory Replenisment of Retail Fasion Products Marsall Fiser Kumar Rajaram Anant Raman Te Warton Scool, University of Pennsylvania, 3620 Locust Walk, 3207 SHDH, Piladelpia, Pennsylvania 191046366
More informationA.4. Rational Expressions. Domain of an Algebraic Expression. What you should learn. Why you should learn it
A6 Appendi A Review of Fundamental Concepts of Algebra A.4 Rational Epressions Wat you sould learn Find domains of algebraic epressions. Simplify rational epressions. Add, subtract, multiply, and divide
More informationPyramidization of Polygonal Prisms and Frustums
European International Journal of cience and ecnology IN: 0499 www.eijst.org.uk Pyramidization of Polygonal Prisms and Frustums Javad Hamadani Zade Department of Matematics Dalton tate College Dalton,
More informationACT Math Facts & Formulas
Numbers, Sequences, Factors Integers:..., 3, 2, 1, 0, 1, 2, 3,... Rationals: fractions, tat is, anyting expressable as a ratio of integers Reals: integers plus rationals plus special numbers suc as
More informationCollege Planning Using Cash Value Life Insurance
College Planning Using Cas Value Life Insurance CAUTION: Te advisor is urged to be extremely cautious of anoter college funding veicle wic provides a guaranteed return of premium immediately if funded
More informationPredicting the behavior of interacting humans by fusing data from multiple sources
Predicting te beavior of interacting umans by fusing data from multiple sources Erik J. Sclict 1, Ritcie Lee 2, David H. Wolpert 3,4, Mykel J. Kocenderfer 1, and Brendan Tracey 5 1 Lincoln Laboratory,
More informationA FLOW NETWORK ANALYSIS OF A LIQUID COOLING SYSTEM THAT INCORPORATES MICROCHANNEL HEAT SINKS
A FLOW NETWORK ANALYSIS OF A LIQUID COOLING SYSTEM THAT INCORPORATES MICROCHANNEL HEAT SINKS Amir Radmer and Suas V. Patankar Innovative Researc, Inc. 3025 Harbor Lane Nort, Suite 300 Plymout, MN 55447
More informationComputer Vision System for Tracking Players in Sports Games
Computer Vision System for Tracking Players in Sports Games Abstract Janez Perš, Stanislav Kovacic Faculty of Electrical Engineering, University of Lublana Tržaška 5, 000 Lublana anez.pers@kiss.unil.si,
More informationMath Test Sections. The College Board: Expanding College Opportunity
Taking te SAT I: Reasoning Test Mat Test Sections Te materials in tese files are intended for individual use by students getting ready to take an SAT Program test; permission for any oter use must be sougt
More informationArea of a Parallelogram
Area of a Parallelogram Focus on After tis lesson, you will be able to... φ develop te φ formula for te area of a parallelogram calculate te area of a parallelogram One of te sapes a marcing band can make
More informationFinite Volume Discretization of the Heat Equation
Lecture Notes 3 Finite Volume Discretization of te Heat Equation We consider finite volume discretizations of te onedimensional variable coefficient eat equation, wit Neumann boundary conditions u t x
More informationSurface Areas of Prisms and Cylinders
12.2 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS G.10.B G.11.C Surface Areas of Prisms and Cylinders Essential Question How can you find te surface area of a prism or a cylinder? Recall tat te surface area of
More informationGEOMETRY. Grades 6 8 Part 1 of 2. Lessons & Worksheets to Build Skills in Measuring Perimeter, Area, Surface Area, and Volume. Poster/Teaching Guide
Grades 6 8 Part 1 of 2 Poster/Teacing Guide GEOMETRY Lessons & Workseets to Build Skills in Measuring Perimeter, Area, Surface Area, and Volume Aligned wit NCTM Standards Mat Grants Available Lesson 1
More information1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution
1.6 Analyse Optimum Volume and Surface Area Estimation and oter informal metods of optimizing measures suc as surface area and volume often lead to reasonable solutions suc as te design of te tent in tis
More informationNew Vocabulary volume
. Plan Objectives To find te volume of a prism To find te volume of a cylinder Examples Finding Volume of a Rectangular Prism Finding Volume of a Triangular Prism 3 Finding Volume of a Cylinder Finding
More informationWeek #15  Word Problems & Differential Equations Section 8.2
Week #1  Word Problems & Differential Equations Section 8. From Calculus, Single Variable by HugesHallett, Gleason, McCallum et. al. Copyrigt 00 by Jon Wiley & Sons, Inc. Tis material is used by permission
More informationTraining Robust Support Vector Regression via D. C. Program
Journal of Information & Computational Science 7: 12 (2010) 2385 2394 Available at ttp://www.joics.com Training Robust Support Vector Regression via D. C. Program Kuaini Wang, Ping Zong, Yaoong Zao College
More informationComputer Science and Engineering, UCSD October 7, 1999 GoldreicLevin Teorem Autor: Bellare Te GoldreicLevin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an nbit
More informationUsing Intelligent Agents to Discover Energy Saving Opportunities within Data Centers
1 Using Intelligent Agents to Discover Energy Saving Opportunities witin Data Centers Alexandre Mello Ferreira and Barbara Pernici Dipartimento di Elettronica, Informazione e Bioingegneria Politecnico
More informationSHAPE: A NEW BUSINESS ANALYTICS WEB PLATFORM FOR GETTING INSIGHTS ON ELECTRICAL LOAD PATTERNS
CIRED Worksop  Rome, 1112 June 2014 SAPE: A NEW BUSINESS ANALYTICS WEB PLATFORM FOR GETTING INSIGTS ON ELECTRICAL LOAD PATTERNS Diego Labate Paolo Giubbini Gianfranco Cicco Mario Ettorre Enel DistribuzioneItaly
More informationVolumes of Pyramids and Cones. Use the Pythagorean Theorem to find the value of the variable. h 2 m. 1.5 m 12 in. 8 in. 2.5 m
5 Wat You ll Learn To find te volume of a pramid To find te volume of a cone... And W To find te volume of a structure in te sape of a pramid, as in Eample Volumes of Pramids and Cones Ceck Skills You
More informationTorchmark Corporation 2001 Third Avenue South Birmingham, Alabama 35233 Contact: Joyce Lane 9725693627 NYSE Symbol: TMK
News Release Torcmark Corporation 2001 Tird Avenue Sout Birmingam, Alabama 35233 Contact: Joyce Lane 9725693627 NYSE Symbol: TMK TORCHMARK CORPORATION REPORTS FOURTH QUARTER AND YEAREND 2004 RESULTS
More informationUnemployment insurance/severance payments and informality in developing countries
Unemployment insurance/severance payments and informality in developing countries David Bardey y and Fernando Jaramillo z First version: September 2011. Tis version: November 2011. Abstract We analyze
More informationCenter of Mass and Centroids :: Guidelines
Center of Mass and Centroids :: Guidelines Centroids of Lines, reas, and Volumes 1.Order of Element Selected for ntegration.continuit.discarding Higer Order Terms.Coice of Coordinates 5.Centroidal Coordinate
More informationStaffing and routing in a twotier call centre. Sameer Hasija*, Edieal J. Pinker and Robert A. Shumsky
8 Int. J. Operational Researc, Vol. 1, Nos. 1/, 005 Staffing and routing in a twotier call centre Sameer Hasija*, Edieal J. Pinker and Robert A. Sumsky Simon Scool, University of Rocester, Rocester 1467,
More informationPioneer Fund Story. Searching for Value Today and Tomorrow. Pioneer Funds Equities
Pioneer Fund Story Searcing for Value Today and Tomorrow Pioneer Funds Equities Pioneer Fund A Cornerstone of Financial Foundations Since 1928 Te fund s relatively cautious stance as kept it competitive
More informationDistances in random graphs with infinite mean degrees
Distances in random graps wit infinite mean degrees Henri van den Esker, Remco van der Hofstad, Gerard Hoogiemstra and Dmitri Znamenski April 26, 2005 Abstract We study random graps wit an i.i.d. degree
More informationPretrial Settlement with Imperfect Private Monitoring
Pretrial Settlement wit Imperfect Private Monitoring Mostafa Beskar University of New Hampsire JeeHyeong Park y Seoul National University July 2011 Incomplete, Do Not Circulate Abstract We model pretrial
More informationVOL. 6, NO. 9, SEPTEMBER 2011 ISSN ARPN Journal of Engineering and Applied Sciences
VOL. 6, NO. 9, SEPTEMBER 0 ISSN 896608 0060 Asian Researc Publising Network (ARPN). All rigts reserved. BIT ERROR RATE, PERFORMANCE ANALYSIS AND COMPARISION OF M x N EQUALIZER BASED MAXIMUM LIKELIHOOD
More informationSWITCH T F T F SELECT. (b) local schedule of two branches. (a) ifthenelse construct A & B MUX. one iteration cycle
768 IEEE RANSACIONS ON COMPUERS, VOL. 46, NO. 7, JULY 997 Compileime Sceduling of Dynamic Constructs in Dataæow Program Graps Soonoi Ha, Member, IEEE and Edward A. Lee, Fellow, IEEE Abstract Sceduling
More informationCyber Epidemic Models with Dependences
Cyber Epidemic Models wit Dependences Maocao Xu 1, Gaofeng Da 2 and Souuai Xu 3 1 Department of Matematics, Illinois State University mxu2@ilstu.edu 2 Institute for Cyber Security, University of Texas
More informationNotes: Most of the material in this chapter is taken from Young and Freedman, Chap. 12.
Capter 6. Fluid Mecanics Notes: Most of te material in tis capter is taken from Young and Freedman, Cap. 12. 6.1 Fluid Statics Fluids, i.e., substances tat can flow, are te subjects of tis capter. But
More informationGroundwater Seepage Estimation into Amirkabir Tunnel Using Analytical Methods and DEM and SGR Method
Groundwater Seepage Estimation into Amirkabir Tunnel Using Analytical Metods and DEM and SGR Metod Hadi Faradian, Homayoon Katibe Abstract In tis paper, groundwater seepage into Amirkabir tunnel as been
More informationNote: Principal version Modification Modification Complete version from 1 October 2014 Business Law Corporate and Contract Law
Note: Te following curriculum is a consolidated version. It is legally nonbinding and for informational purposes only. Te legally binding versions are found in te University of Innsbruck Bulletins (in
More informationOPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS
New Developments in Structural Engineering and Construction Yazdani, S. and Sing, A. (eds.) ISEC7, Honolulu, June 1823, 2013 OPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS JIALI FU 1, ERIK JENELIUS
More informationReinforced Concrete Beam
Mecanics of Materials Reinforced Concrete Beam Concrete Beam Concrete Beam We will examine a concrete eam in ending P P A concrete eam is wat we call a composite eam It is made of two materials: concrete
More informationANALYTICAL REPORT ON THE 2010 URBAN EMPLOYMENT UNEMPLOYMENT SURVEY
THE FEDERAL DEMOCRATIC REPUBLIC OF ETHIOPIA CENTRAL STATISTICAL AGENCY ANALYTICAL REPORT ON THE 2010 URBAN EMPLOYMENT UNEMPLOYMENT SURVEY Addis Ababa December 2010 STATISTICAL BULLETIN TABLE OF CONTENT
More informationSimultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning
Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning SooHaeng Co Hoon Jang Taesik Lee Jon Turner Tepper Scool of Business, Carnegie Mellon University, Pittsburg,
More informationCHAPTER 7. Di erentiation
CHAPTER 7 Di erentiation 1. Te Derivative at a Point Definition 7.1. Let f be a function defined on a neigborood of x 0. f is di erentiable at x 0, if te following it exists: f 0 fx 0 + ) fx 0 ) x 0 )=.
More informationImproved dynamic programs for some batcing problems involving te maximum lateness criterion A P M Wagelmans Econometric Institute Erasmus University Rotterdam PO Box 1738, 3000 DR Rotterdam Te Neterlands
More informationHardness Measurement of Metals Static Methods
Hardness Testing Principles and Applications Copyrigt 2011 ASM International Konrad Herrmann, editor All rigts reserved. www.asminternational.org Capter 2 Hardness Measurement of Metals Static Metods T.
More informationFor Sale By Owner Program. We can help with our for sale by owner kit that includes:
Dawn Coen Broker/Owner For Sale By Owner Program If you want to sell your ome By Owner wy not:: For Sale Dawn Coen Broker/Owner YOUR NAME YOUR PHONE # Look as professional as possible Be totally prepared
More informationUnderstanding the Derivative Backward and Forward by Dave Slomer
Understanding te Derivative Backward and Forward by Dave Slomer Slopes of lines are important, giving average rates of cange. Slopes of curves are even more important, giving instantaneous rates of cange.
More informationMultidimensional index structures Part I: motivation
Multidimensional 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 informationP.4 Rational Expressions
7_0P04.qp /7/06 9:4 AM Page 7 Section P.4 Rational Epressions 7 P.4 Rational Epressions Domain of an Algebraic Epression Te set of real numbers for wic an algebraic epression is defined is te domain of
More informationON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE
ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE Byeong U. Park 1 and Young Kyung Lee 2 Department of Statistics, Seoul National University, Seoul, Korea Tae Yoon Kim 3 and Ceolyong Park
More informationICE FOOD DEPOT COOLED WITH A HEAT PUMP: A PREFEASIBILITY STUDY
ICE FOOD DEPOT COOLED WITH A HEAT PUMP: A PREFEASIBILITY STUDY S.A. Guly, G.Z. Perlstein NortEastern Researc Station o Permarost Institute, Siberian Branc o Russian Academy o Sciences. 12, Gagarin St.,
More information