Optimized Data Indexing Algorithms for OLAP Systems
|
|
- Florence Potter
- 8 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 lucianbor@otmail.com 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 n-dimensional summarized data stored in cubes. Today database systems implement derived indexing algoritms based on well-known 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 n-dimensional cube indexing algoritm, derived from te well known B-Tree index, wic indexes data stored in data wareouses taking in consideration teir multidimensional nature and provides better performance in comparison to te already implemented Tree-like index types. Keywords: data wareouse; indexing algoritm; OLAP, n-tree. 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 (B-Tree, Bitmap, R-Tree etc.). Processed data are stored in n-dimensional 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 Quarter-Mont-Year, Time dimension can belong to te ierarcy Day-Mont-Year. 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 B-Tree 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 B-Tree index used in OLAP systems contains sub-trees corresponding to eac dimension. Te sub-trees 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 sub-tree corresponding to eac dimension. Tus, a tree dimensional cube contains tree levels. Te first level represents a matrix of planes (bi-dimensional 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 B-Tree index for a tree-dimensional cube [3] Tus, eac cube size will correspond to one sub-tree of te B-Tree index and eac sub-tree will ave on cild sub-tree 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 B-Tree 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 sub-tree. 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 sub-tree 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 sub-tree 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 sub-tree, 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 sub-tree corresponding to te dimension j and d- is te total number of root nodes used as connecting elements of te leaf blocks of sub-trees 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 B-Tree 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 B-Tree index used for indexing cubes is equal to storage space for all its sub-trees. For a cube wit tree dimensions, te number of sub-trees of a B-Tree index is: were N si is te number of sub-trees 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 B-Tree 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 sub-trees coresponding to te dimension i and S rn is te size of all nodes connecting te sub-trees. Te query cost of te B-Tree index is te sum of te cost of all sub-trees between te root node and te index leaf block wic store te pysical address of te cell. 4. Te n-tree Indexing Algoritm Given te caracteristics of cubes, as well as te structure of a B-Tree index, it becomes obvious tat tis indexing algoritm is not optimized for n-dimensional data structures. Tus, te number of subtrees witin te index is directly proportional wit te number of dimensions. As a consequence, te cube is over-indexed resulting in an overconsumption of processing time and storage space. Te proposed n-dimensional indexing algoritm pays attention to te n- dimensional structure of te data. Instead of creating sub-trees corresponding to eac dimension and subsequently linking tem, it creates only one tree wic indexes data simultaneously on all dimensions. As a result, te n-dimensional space is gradually divided into ever smaller n-dimensional subdivisions, until te smallest sub-divisions 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 n-dimensional 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 n-tree index contains a sub-tree tat indexes te summarized data wic as te following caracteristics: - it contains a sub-tree for eac dimension of te cube;
6 22 Optimized Data Indexing Algoritms for OLAP Systems - eac sub-tree 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 sub-trees 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 Sub-tree wic indexes te cube cells Sub-tree 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 n-tree 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 sub-tree corresponding to one dimension are equivalent to a to (n-) dimensional sub-space. Te sub-spaces are distributed among te respective sub-trees, as to avoid storing multiple references to te same summarized data. Te dimensions of te index are tus reduced. For a 3-dimensional cube, te index leaf blocks will contain te following references: - te elements of te index leaf block of te X dimension sub-tree 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 sub-tree 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 sub-tree 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 n-tree Index To create an n-dimensional index, all data in every index is read and n-dimensional points are created. For eac of tese points, te following operations are carried out: - an index block corresponding to an n- dimensional sub-space 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 n-dimensional point corresponding to a specific dimension were previously inserted te necessary free space is smaller tan te element size. 6. Te Performance of te n-tree 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 n-tree 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 two-dimensional 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 n-tree 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 n-tree index to tat of a B-Tree 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 n-tree index query cost is lower te te B-Tree 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 n-tree index query cost is lower tan te B-Tree 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 n-tree index is muc smaller tan te B-Tree 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 two-dimensional cube Fig. - Te summarized data query cost for a tree-dimensional 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 n-tree index could be considered a more generalized B-tree index. If B-Tree index can index only uni-dimesional data, te n-tree index is optimized for any n- dimensional data. Moreover, te n-tree index will be more suitable for indexing spatial data. As sown in figures 5-9, te n-tree index outperforms te B-Tree 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 n-tree index in muc smaller tan tat needed for a B-Tree index. Again te superiority of te n-tree 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 Rau-caplin, Computational Science - ICCS 200; [4] Ubiquitous B-Tree, Douglas Corner, ACM, 979; [5] MCTS 70-43: 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 Anti-perspective Correction Algorithm of QR Barcode
Researc on te Anti-perspective Correction Algoritm of QR Barcode Jianua Li, Yi-Wen 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 SPARS-J
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 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 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 informationHow To Ensure That An Eac Edge Program Is Successful
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 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 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 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 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 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 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 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 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 informationCan a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade?
Can a Lump-Sum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lump-sum transfer rules to redistribute te
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 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 informationThe modelling of business rules for dashboard reporting using mutual information
8 t World IMACS / MODSIM Congress, Cairns, Australia 3-7 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,
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 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 informationArea-Specific Recreation Use Estimation Using the National Visitor Use Monitoring Program Data
United States Department of Agriculture Forest Service Pacific Nortwest Researc Station Researc Note PNW-RN-557 July 2007 Area-Specific Recreation Use Estimation Using te National Visitor Use Monitoring
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 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 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 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 two-dimensional (D) sape is te total distance around te edge of te sape. l To work out te perimeter
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 informationBinary Search Trees. Adnan Aziz. Heaps can perform extract-max, insert efficiently O(log n) worst case
Binary Searc Trees Adnan Aziz 1 BST basics Based on CLRS, C 12. Motivation: Heaps can perform extract-max, insert efficiently O(log n) worst case Has tables can perform insert, delete, lookup efficiently
More informationTis Problem and Retail Inventory Management
Optimizing Inventory Replenisment of Retail Fasion Products Marsall Fiser Kumar Rajaram Anant Raman Te Warton Scool, University of Pennsylvania, 3620 Locust Walk, 3207 SH-DH, Piladelpia, Pennsylvania 19104-6366
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 informationCatalogue no. 12-001-XIE. Survey Methodology. December 2004
Catalogue no. 1-001-XIE 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 informationAn inquiry into the multiplier process in IS-LM model
An inquiry into te multiplier process in IS-LM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 00-62763074 Internet Address: jefferson@water.pu.edu.cn
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 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 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 informationDesign and Analysis of a Fault-Tolerant Mechanism for a Server-Less Video-On-Demand System
Design and Analysis of a Fault-olerant Mecanism for a Server-Less Video-On-Demand System Jack Y. B. Lee Department of Information Engineering e Cinese University of Hong Kong Satin, N.., Hong Kong Email:
More informationTangent Lines and Rates of Change
Tangent Lines and Rates of Cange 9-2-2005 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 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 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 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 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 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 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 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 Goldreic-Levin Teorem Autor: Bellare Te Goldreic-Levin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an n-bit
More informationSHAPE: A NEW BUSINESS ANALYTICS WEB PLATFORM FOR GETTING INSIGHTS ON ELECTRICAL LOAD PATTERNS
CIRED Worksop - Rome, 11-12 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 Distribuzione-Italy
More informationStaffing and routing in a two-tier 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 two-tier call centre Sameer Hasija*, Edieal J. Pinker and Robert A. Sumsky Simon Scool, University of Rocester, Rocester 1467,
More informationPre-trial Settlement with Imperfect Private Monitoring
Pre-trial Settlement wit Imperfect Private Monitoring Mostafa Beskar University of New Hampsire Jee-Hyeong Park y Seoul National University July 2011 Incomplete, Do Not Circulate Abstract We model pretrial
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 informationSWITCH T F T F SELECT. (b) local schedule of two branches. (a) if-then-else construct A & B MUX. one iteration cycle
768 IEEE RANSACIONS ON COMPUERS, VOL. 46, NO. 7, JULY 997 Compile-ime Sceduling of Dynamic Constructs in Dataæow Program Graps Soonoi Ha, Member, IEEE and Edward A. Lee, Fellow, IEEE Abstract Sceduling
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 informationOPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS
New Developments in Structural Engineering and Construction Yazdani, S. and Sing, A. (eds.) ISEC-7, Honolulu, June 18-23, 2013 OPTIMAL FLEET SELECTION FOR EARTHMOVING OPERATIONS JIALI FU 1, ERIK JENELIUS
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 informationSimultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning
Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning Soo-Haeng Co Hoon Jang Taesik Lee Jon Turner Tepper Scool of Business, Carnegie Mellon University, Pittsburg,
More informationTorchmark Corporation 2001 Third Avenue South Birmingham, Alabama 35233 Contact: Joyce Lane 972-569-3627 NYSE Symbol: TMK
News Release Torcmark Corporation 2001 Tird Avenue Sout Birmingam, Alabama 35233 Contact: Joyce Lane 972-569-3627 NYSE Symbol: TMK TORCHMARK CORPORATION REPORTS FOURTH QUARTER AND YEAR-END 2004 RESULTS
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 informationWorking Capital 2013 UK plc s unproductive 69 billion
2013 Executive summary 2. Te level of excess working capital increased 3. UK sectors acieve a mixed performance 4. Size matters in te supply cain 6. Not all companies are overflowing wit cas 8. Excess
More informationResearch on Risk Assessment of PFI Projects Based on Grid-fuzzy Borda Number
Researc on Risk Assessent of PFI Projects Based on Grid-fuzzy Borda Nuber LI Hailing 1, SHI Bensan 2 1. Scool of Arcitecture and Civil Engineering, Xiua University, Cina, 610039 2. Scool of Econoics and
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 non-binding and for informational purposes only. Te legally binding versions are found in te University of Innsbruck Bulletins (in
More informationYale ICF Working Paper No. 05-11 May 2005
Yale ICF Working Paper No. 05-11 May 2005 HUMAN CAPITAL, AET ALLOCATION, AND LIFE INURANCE Roger G. Ibbotson, Yale cool of Management, Yale University Peng Cen, Ibbotson Associates Mose Milevsky, culic
More informationSAT Math Must-Know Facts & Formulas
SAT Mat Must-Know Facts & Formuas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationas: fractions, tat is, anyting expressabe as a ratio of integers Reas: integers pus rationas
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 informationICE FOOD DEPOT COOLED WITH A HEAT PUMP: A PRE-FEASIBILITY STUDY
ICE FOOD DEPOT COOLED WITH A HEAT PUMP: A PRE-FEASIBILITY STUDY S.A. Guly, G.Z. Perlstein Nort-Eastern Researc Station o Permarost Institute, Siberian Branc o Russian Academy o Sciences. 12, Gagarin St.,
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 informationTo motivate the notion of a variogram for a covariance stationary process, { Ys ( ): s R}
4. Variograms Te covariogram and its normalized form, te correlogram, are by far te most intuitive metods for summarizing te structure of spatial dependencies in a covariance stationary process. However,
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 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 informationHuman Capital, Asset Allocation, and Life Insurance
Human Capital, Asset Allocation, and Life Insurance By: P. Cen, R. Ibbotson, M. Milevsky and K. Zu Version: February 25, 2005 Note: A Revised version of tis paper is fortcoming in te Financial Analysts
More informationArtificial Neural Networks for Time Series Prediction - a novel Approach to Inventory Management using Asymmetric Cost Functions
Artificial Neural Networks for Time Series Prediction - a novel Approac to Inventory Management using Asymmetric Cost Functions Sven F. Crone University of Hamburg, Institute of Information Systems crone@econ.uni-amburg.de
More informationMacroeconomic conditions influence consumers attitudes,
Yu Ma, Kusum L. Ailawadi, Dines K. Gauri, & Druv Grewal An Empirical Investigation of te Impact of Gasoline Prices on Grocery Sopping Beavior Te autors empirically examine te effect of gas prices on grocery
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 information2.12 Student Transportation. Introduction
Introduction Figure 1 At 31 Marc 2003, tere were approximately 84,000 students enrolled in scools in te Province of Newfoundland and Labrador, of wic an estimated 57,000 were transported by scool buses.
More informationPretrial Settlement with Imperfect Private Monitoring
Pretrial Settlement wit Imperfect Private Monitoring Mostafa Beskar Indiana University Jee-Hyeong Park y Seoul National University April, 2016 Extremely Preliminary; Please Do Not Circulate. Abstract We
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 informationOrchestrating Bulk Data Transfers across Geo-Distributed Datacenters
Tis article as been accepted for publication in a future issue of tis journal, but as not been fully edited Content may cange prior to final publication Citation information: DOI 101109/TCC20152389842,
More informationReferendum-led Immigration Policy in the Welfare State
Referendum-led Immigration Policy in te Welfare State YUJI TAMURA Department of Economics, University of Warwick, UK First version: 12 December 2003 Updated: 16 Marc 2004 Abstract Preferences of eterogeneous
More informationProjective Geometry. Projective Geometry
Euclidean versus Euclidean geometry describes sapes as tey are Properties of objects tat are uncanged by rigid motions» Lengts» Angles» Parallelism Projective geometry describes objects as tey appear Lengts,
More informationWORKING PAPER SERIES THE INFORMATIONAL CONTENT OF OVER-THE-COUNTER CURRENCY OPTIONS NO. 366 / JUNE 2004. by Peter Christoffersen and Stefano Mazzotta
WORKING PAPER SERIES NO. 366 / JUNE 24 THE INFORMATIONAL CONTENT OF OVER-THE-COUNTER CURRENCY OPTIONS by Peter Cristoffersen and Stefano Mazzotta WORKING PAPER SERIES NO. 366 / JUNE 24 THE INFORMATIONAL
More information100 Austrian Journal of Statistics, Vol. 32 (2003), No. 1&2, 99-129
AUSTRIAN JOURNAL OF STATISTICS Volume 3 003, Number 1&, 99 19 Adaptive Regression on te Real Line in Classes of Smoot Functions L.M. Artiles and B.Y. Levit Eurandom, Eindoven, te Neterlands Queen s University,
More informationKeskustelualoitteita #65 Joensuun yliopisto, Taloustieteet. Market effiency in Finnish harness horse racing. Niko Suhonen
Keskustelualoitteita #65 Joensuun yliopisto, Taloustieteet Market effiency in Finnis arness orse racing Niko Suonen ISBN 978-952-219-283-7 ISSN 1795-7885 no 65 Market Efficiency in Finnis Harness Horse
More informationOnce you have reviewed the bulletin, please
Akron Public Scools OFFICE OF CAREER EDUCATION BULLETIN #5 : Driver Responsibilities 1. Akron Board of Education employees assigned to drive Board-owned or leased veicles MUST BE FAMILIAR wit te Business
More informationAbstract. Introduction
Fast solution of te Sallow Water Equations using GPU tecnology A Crossley, R Lamb, S Waller JBA Consulting, Sout Barn, Brougton Hall, Skipton, Nort Yorksire, BD23 3AE. amanda.crossley@baconsulting.co.uk
More informationTheoretical calculation of the heat capacity
eoretical calculation of te eat capacity Principle of equipartition of energy Heat capacity of ideal and real gases Heat capacity of solids: Dulong-Petit, Einstein, Debye models Heat capacity of metals
More informationStaying in-between Music Technology in Higher Education
Staying in-between Music Tecnology in Higer Education (Post-modern) Callenges and Opportunities for Music Tecnology Education Carola Boem Carola Boem Centre for Music Tecnology Department of Music Department
More informationAnalyzing the Effects of Insuring Health Risks:
Analyzing te Effects of Insuring Healt Risks: On te Trade-off between Sort Run Insurance Benefits vs. Long Run Incentive Costs Harold L. Cole University of Pennsylvania and NBER Soojin Kim University of
More informationNAFN NEWS SPRING2011 ISSUE 7. Welcome to the Spring edition of the NAFN Newsletter! INDEX. Service Updates Follow That Car! Turn Back The Clock
NAFN NEWS ISSUE 7 SPRING2011 Welcome to te Spring edition of te NAFN Newsletter! Spring is in te air at NAFN as we see several new services cropping up. Driving and transport emerged as a natural teme
More informationFINANCIAL SECTOR INEFFICIENCIES AND THE DEBT LAFFER CURVE
INTERNATIONAL JOURNAL OF FINANCE AND ECONOMICS Int. J. Fin. Econ. 10: 1 13 (2005) Publised online in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/ijfe.251 FINANCIAL SECTOR INEFFICIENCIES
More informationPerformance Evaluation of Selected Category of Public Sector Mutual Fund Schemes in India
Performance Evaluation of Selected Category of Public Sector Mutual Scemes in India Dr. R. Karrupasamy Director, Department of Management Studies Neru College of Tecnology, Coimbatore, Sout India. Mrs.
More informationChannel Allocation in Non-Cooperative Multi-Radio Multi-Channel Wireless Networks
Cannel Allocation in Non-Cooperative Multi-Radio Multi-Cannel Wireless Networks Dejun Yang, Xi Fang, Guoliang Xue Arizona State University Abstract Wile tremendous efforts ave been made on cannel allocation
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 informationChapter 7 Numerical Differentiation and Integration
45 We ave a abit in writing articles publised in scientiþc journals to make te work as Þnised as possible, to cover up all te tracks, to not worry about te blind alleys or describe ow you ad te wrong idea
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 informationMultigrid computational methods are
M ULTIGRID C OMPUTING Wy Multigrid Metods Are So Efficient Originally introduced as a way to numerically solve elliptic boundary-value problems, multigrid metods, and teir various multiscale descendants,
More informationFactoring Synchronous Grammars By Sorting
Factoring Syncronous Grammars By Sorting Daniel Gildea Computer Science Dept. Uniersity of Rocester Rocester, NY Giorgio Satta Dept. of Information Eng g Uniersity of Padua I- Padua, Italy Hao Zang Computer
More informationWarm medium, T H T T H T L. s Cold medium, T L
Refrigeration Cycle Heat flows in direction of decreasing temperature, i.e., from ig-temperature to low temperature regions. Te transfer of eat from a low-temperature to ig-temperature requires a refrigerator
More informationh Understanding the safe operating principles and h Gaining maximum benefit and efficiency from your h Evaluating your testing system's performance
EXTRA TM Instron Services Revolve Around You It is everyting you expect from a global organization Te global training centers offer a complete educational service for users of advanced materials testing
More informationUNIFORM FLOW. Key words Uniform flow; most economical cross-section; discharge; velocity; erosion; sedimentation
Capter UNIFORM FLOW.. Introduction.. Basic equations in uniform open-cannel flow.3. Most economical cross-section.4. Cannel wit compound cross-section.5. Permissible velocity against erosion and sedimentation
More informationR-trees. R-Trees: A Dynamic Index Structure For Spatial Searching. R-Tree. Invariants
R-Trees: A Dynamic Index Structure For Spatial Searching A. Guttman R-trees Generalization of B+-trees to higher dimensions Disk-based index structure Occupancy guarantee Multiple search paths Insertions
More information