KEMB: A Keyword-Based XML Message Broker
KEMB:
A Keyword-Based XML Message Broker
Abstract:
This
paper studies the problem of XML message brokering with user subscribed
profiles of keyword queries, and presents a KEyword-based XML Message Broker
(KEMB) to address this problem. In contrast to traditional path expressions
based XML message brokers, KEMB stores a large number of user profiles, in the
form of keyword queries, which capture the data requirement of
users/applications, as opposed to path expressions, such as XPath/XQuery
expressions. KEMB brings new challenges: how to effectively identify relevant
answers of keyword queries in XML data streams; and how to efficiently answer
large numbers of concurrent keyword queries. We adopt compact lowest common
ancestors (CLCAs) to effectively identify relevant answers. We devise an
automaton-based method to process large numbers of queries and devise an
effective optimization strategy to enhance performance and scalability. We have
implemented and evaluated KEMB on various datasets. The experimental results
show that KEMB achieves high performance and scales very well.
Existing System:
The existing proposal for KEMB: a
keyword based XML message broker system is KEMB to address the
problem of keyword-based XML message brokering with user subscribed profiles of
keyword queries. For this we implemented the concept of compact lowest common ancestors (CLCAs) to effectively identify
relevant answers of keyword queries over XML data streams.
The
performance also less.
Proposed System:
In this paper We
devise an automaton-based method to process large numbers of keyword queries.
We propose maximal coverage rules and coverage graph to accelerate the
processing of large numbers of concurrent keyword queries by effectively
indexing the keyword queries. With KEMB we can also improves the performance
and scales very well.
·
By using XML We can improve performance.
·
Here we are using automation technique,
so it provides dynamic schema.
·
The transitions
in the automaton are triggered by the tags of the XML document being processed.
·
We can avoid
prefix overlaps between expressions by extending XFilter.
·
We can extend XFilter from YFilter by building
a non-deterministic finite automaton (NFA) for all XPath expressions in the
system.
KEYWORDS:
Generic Technology Keywords: Database,
User Interface, Programming
Specific Technology Keywords: C#.Net, ASP.Net,
MS SqlServer-08
Project Keywords: Presentation, Business Object, Data Access Layer, Database
SDLC Keywords: Analysis, Design, Code, Testing, Implementation, Maintenance
SYSTEM
CONFIGURATION
HARDWARE
CONFIGURATION
|
S.NO
|
HARDWARE
|
CONFIGURATIONS
|
|
1
|
Operating System
|
Windows 2000 & XP
|
|
2
|
RAM
|
1GB
|
|
3
|
Processor (with Speed)
|
Intel
Pentium IV (3.0 GHz) and Upwards
|
|
4
|
Hard Disk Size
|
40 GB and above
|
|
5
|
Monitor
|
15’ CRT
|
SOFTWARE
CONFIGURATION
|
S.NO
|
SOFTWARE
|
CONFIGURATIONS
|
|
1
|
Platform
|
Microsoft Visual Studio
|
|
2
|
Framework
|
.Net Framework 4.0
|
|
3
|
Language
|
C#.Net
|
|
4
|
Front End
|
Windows application
|
|
5
|
Back End
|
SQL Server 2008
|
Categories:
0 comments:
Post a Comment