Searching SNT in XML Documents Using Reduction Factor
Journal Title: Indian Journal of Computer Science and Engineering - Year 2013, Vol 4, Issue 5
Abstract
XML has become the most popular standard for data representation. In XML standard the documents represented as rooted ordered trees. The efficient query processing can be performed on the labeled document structure. The major advantage of keyword search is the user need not understand the complex query language and the structure. This paper proposes a modified H –Reduction factor which solve the inconsistency and the abnormality problem in the Xreal and Dynamic- infer method. The experimental result shows the effectiveness of the proposed approaches.
Authors and Affiliations
Mary Posonia A , Dr V L Jyothi
Keywords
Related Articles
- EP ID EP141404
- DOI -
- Views 117
- Downloads 0
CONTENT BASED LEAF IMAGE RETRIEVAL (CBLIR) USING SHAPE, COLOR AND TEXTURE FEATURES
This paper proposes an efficient computer-aided Plant Image Retrieval method based on plant leaf images using Shape, Color and Texture features intended mainly for medical industry, botanical gardening and cosmetic indus...
RANK LEVEL FUSION USING FINGERPRINT AND IRIS BIOMETRICS
Authentication of users is an essential and difficult to achieve in all systems. Shared secrets like Personal Identification Numbers (PIN) or Passwords and key devices such as Smart cards are not presently sufficient in...
SV MACHINES FOR FUNCTION ESTIMATION COVERING QUADRATIC PROGRAMMING WITH LARGE DATA SETS USING FOR INTERIOR POINT ALGORITHM
Support Vector Machines (SVM) algorithms combine the simplicity and computational efficiency of linear algorithms, such as the perception algorithm or ridge regression, with the flexibility of nonlinear systems, like neu...
Enhance Reliability of Web service composition Using Negotiation Mechanism
A service-oriented architecture (SOA) is essentially a repository of custom and unique services that can selforganize it based on communication. The communication can involve either simple data passing or it could involv...
SURVEY ON HEURISTICS BASED RESOURCE SCHEDULING IN GRID COMPUTING
The most important goal of the Resource Scheduling in Grid Computing is to efficiently map the jobs to resources. Resource Scheduling in Grid computing is a complex task because of the heterogeneous environment. Grid Sch...