1 / 24

# Implementation of Multi-dimensional Indexing using Pyramid Technique Presented by - PowerPoint PPT Presentation

Implementation of Multi-dimensional Indexing using Pyramid Technique Presented by Shunmuga Prabhu.A Sanjeetha Devi. S Retna. M. V. Abstract. Implementing Pyramid Techniques in Multi Dimensional database. Concepts of PASS Bots and Search Engine.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Implementation of Multi-dimensional Indexing using Pyramid Technique Presented by' - rudyard-moon

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Multi-dimensional Indexing using

Pyramid Technique

Presented by

Shunmuga Prabhu.A

Sanjeetha Devi. S

Retna. M. V.

Implementing Pyramid Techniques in Multi Dimensional database

Concepts of PASS Bots and Search Engine

Implementing these techniques with the help of Latest web programming languages and database.

A form of database that is designed to make the best use of storing and utilizing data

To optimize online analytical processing (OLAP) and data warehouse applications

Higher level of organization than the relational table

d Dimensional range

2d 1-dimensional range

B+ Tree

Split the data space into 2d pyramids having the center point of the data space (0.5, 0.5, ..., 0.5)

Each of the 2d pyramids is divided into several partitions each corresponding to one data page of the B+-tree

Definition 1: (Pyramid of a point v)

A d-dimensional point v is defined to be located in pyramid pi,

jmax if (vjmax < 0.5)

j

=

(jmax+d) if (vjmax ≥ 0.5)

Definition 2: (Height of a point v)

Given a d-dimensional point v. Let pi be the pyramid in which v is located according to Definition 1. Then, the height hvof the point v is defined as

Definition 3: (Pyramid value of a point v)

Given:

a d-dimensional point v

Let pibe the pyramid in which v is located according to Definition 1.

hvbe the height of v according to Definition 2.

Then, the pyramid value pvvof v is defined as

pvv = ( i + hv )

Most of the dimensional databases linked in the form of star schema

Use of Online Transaction Processing (OLTP) Concepts

Databases are not indexed

Multi Dimensional Databases linked in the form of Snowflake Schema

Use of Online Analytical Processing (OLAP) Concepts

All the dimensional databases are indexed, So the query result will be faster than old.

PHP

Standard CGI, FastCGI and Apache module support

Access Control

Extended Regular Expressions

MySQL

Massive data warehouses holding terabytes of information

Strong support for specialized web functions

High-performance query engine

AJAX

Increased interactivity and responsiveness

Run automated tasks over the Internet

An automated script fetches, analyses and files information from web servers at many times the speed of a human

Our Bots search the link and its contents, title and description in rapidly and also collect the backup of the website

Crawled 700 rows in URL table, 25000 rows in web content table

Query

The search results are returned into fraction of a second

The web server sends the query into the index server

User

Web Server

Doc Server

Index Server

Snippets are generated to describe each search result.

It tells which pages contains the words that match any particular query

A database index is a data structure that improves the speed of operations in a table.

Determine the pyramid value pvv of the point and insert the point into a B+-tree using pvv as a key.

SQL Query Statement for Indexing

Create index sweb using btree on webcontent (height);

To examine which pyramids are affected by the query

To determine the ranges inside the pyramids

Determining all such objects is a one-dimensional indexing problem

if(count(\$searchword)>=1)

{foreach(\$searchword as \$key=>\$value)

\$search.="contents like '% " . trim(\$value) ." %' and “;

}

\$sql='select * from webcontent use index (sweb) where '. \$search;

\$res=\$dbconn->query(\$sql) or die(\$dbconn->errorInfo());