Você está na página 1de 9

A Signature Based Indexing Method For Efficient

Content Based Retrieval


of Relative Temporal Patterns

K.Ashish Kumar(07B61A0549)
T.Ashok(08B65A0503)
SK.Rahim(07B61A0558)
G.Bala Krishna(07B61A0538)

GUIDE: H.O.D:
K.Prashanth Kumar P.V.S.Siva
Prasad
Software Requirement Specification(SRS):

Purpose:

 The purpose of the software requirement specification is to establish the


major requirements necessory to develop the signature based indexing
method for efficient content based retrieval of relative temporal patterns.

Scope:

 The scope of the project is it works efficiently until the database has data
related to the content which is searched to retrieve temporal patterns.
Definitions,Acronyms and Abbreviations

DMQL - Data Mining Query Language.


SQL - Structured Query Language.
J2ME - Java 2 Micro Edition.
JDBC - Java Data Base Connectivity.
OLEDB - Object Linking And Embedding Data Base.
F - Size of Signature(in bits).
N - Number of States.
Q - Size of Query.

Signature File -
A signature is a bit pattern formed for a data object,which is then stored in
a signature file.signature files were originally proposed in the context of word
retrieval in text databases.
Overall Description
Product Perspective :

 A number of algorithms have been proposed for the discovery of data’s from
the large database. However, since the number of generated patterns can be
large, selecting which patterns to analyze can be nontrivial.

 In the Existing System Inverted Files indexing method concentrates on


partial match retrieval, which is basically subset queries. An inverted list that
stores a list of references to all occurrences of this value in the database.

 In our Proposed System we focus on supporting content-based queries of


data’s from the database. Efficiently it can be retrieved by signature file
indexing method.
System Interfaces

User Interface :

 User interacts with the application with the help of SQL(Structered Query
Languange) by simply entering queries.
 
Hardware Interface :

 The DBMS accepts requests for data from the application program and
instructs the operating system to transfer the appropriate data.

 When a DBMS is used, information systems can be changed much more


easily as the organization's information requirements change.

 New categories of data can be added to the database without disruption to


the existing system.
Memory Constraints

Softw are Requirements :

Front End : J2EE


Back End : MY SQL 2000
Operating System : Windows XP
 
Hard Ware Reqirements :

Processor : Pentium IV
Memory : 80 GB
RAM : 1GB
Functional Requirements

Functional :

 A signature is a bit pattern formed for a data object, which is then stored
the signature file. Signature files were originally proposed in the context of
word retrieval in text databases

 Recently, they have been used in a wider set of applications, including


office automation, hypertext systems, relational and object-oriented
databases,
and datamining.

 A query signature is generated from the query set Q (in the same way as the
target signature).
Non Functional Requirements:

Non Functional:

 Subpattern queries. Find those patterns in D that contain q.


 Superpattern queries. Find those patterns in D that are a subpattern of q.
 Equality queries. Find those patterns in D equal to q.

Subpattern Queries:
Given a temporal pattern data base D and query pattern q,the algorithm for
evaluating subpattern queries is called subpattern(D,q) which finds temporal
patterns in D that contain q
Superpattern Queries:
Evaluates SuperPattern (D,q) be the algorithm for evaluating superpattern
queries, that is, for finding temporal patterns in D that are contained in q.

Equality Queries:

Evaluates Equality(D,q) be the algorithm for processing equality queries.


 
K-nearest Subpattern Queries:

K-nearest queries are used to limit the number of patterns generated by


subpattern
queries. Given that a subpattern query generates n temporal patterns
containing
the query pattern q, the k-nearest subpattern query is used to choose k of n
temporal patterns, where k<n, that are most similar to q.

Você também pode gostar