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 121
- Downloads 0
Three Party Authentication Key Distributed Protocols Using Implicit and Explicit Quantum Cryptography
Cryptography is the science of information security. Applications of cryptography include ATM cards, computer passwords, and electronic commerce. The combination of Implicit quantum key distribution protocol (3AQKDP) and...
EXPLORING GPU MEMORY PERFORMANCE USING DIGITAL IMAGE PROCESSING ALGORITHMS
Leveraging the incredible parallel computational power of graphics processing units (GPUs) is a proven method for accelerating general applications. Efficient utilization of the GPU remains one of the greatest challenges...
AN OPTIMIZED GLOBAL SYNCHRONIZATION ON SDDCN
The complex networks have been gaining increasing research attention because of their potential applications in many real-world systems from a variety of fields such as biology, social systems, linguistic networks, and t...
PERFORMANCE ANALYSIS OF DOWNLINK MIMO IN 2X2 MOBILE WIMAX SYSTEM
In this paper, we analyze the error rate performance of downlink coded multiple-input multiple-output orthogonal frequency division multiple access (MIMO OFDMA) systems under frequency selective fading channel conditions...
Discovering Non-Redundant Association Rules using MinMax Approximation Rules
Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redund...