We propose a list data sharing model, which utilizes semantics expressed in DTD for concurrency control of shared XML trees. In this model, tree updating actions such as inserting and/or deleting subtrees are allowed only for repetitive parts. The proposed model guarantees that the resulting XML tree is valid even when tree update actions are applied concurrently. In addition, we propose a new multi-granularity locking mechanism called list locking protocol. This protocol locks on the (index) list of repetitive children nodes and thus allows updates to the descendents when the node child¡¯s subtree is being deleted or inserted. This protocol is expected to be more accessible and to produce fewer locking objects on XML data compared to other methods. Moreover, the prototype system shows that list locking is well suited to user interface of shared XML clients by enabling/disabling corresponding edit operation controls.
DEVELOPING A NOVEL MULTIDIMENSIONAL MULTIGRANULARITY DATA MINING APPROACH FOR...cscpconf
Data Mining is one of the most significant tools for discovering association patterns that are useful for many knowledge domains. Yet, there are some drawbacks in existing mining techniques. Three main weaknesses of current data-mining techniques are: 1) re-scanning of the entire database must be done whenever new attributes are added. 2) An association rule may be true on a certain granularity but fail on a smaller ones and vise verse. 3) Current methods can only be used to find either frequent rules or infrequent rules, but not both at the same time. This research proposes a novel data schema and an algorithm that solves the above weaknesses while improving on the efficiency and effectiveness of data mining strategies. Crucial mechanisms in each step will be clarified in this paper. Finally, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove its advantages.
ADO.NET Architecture
Data processing has traditionally relied primarily on a connection-based, two-tier model. As data
processing increasingly uses multi-tier architectures, programmers are switching to a
disconnected approach to provide better scalability for their applications.
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies
DEVELOPING A NOVEL MULTIDIMENSIONAL MULTIGRANULARITY DATA MINING APPROACH FOR...cscpconf
Data Mining is one of the most significant tools for discovering association patterns that are useful for many knowledge domains. Yet, there are some drawbacks in existing mining techniques. Three main weaknesses of current data-mining techniques are: 1) re-scanning of the entire database must be done whenever new attributes are added. 2) An association rule may be true on a certain granularity but fail on a smaller ones and vise verse. 3) Current methods can only be used to find either frequent rules or infrequent rules, but not both at the same time. This research proposes a novel data schema and an algorithm that solves the above weaknesses while improving on the efficiency and effectiveness of data mining strategies. Crucial mechanisms in each step will be clarified in this paper. Finally, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove its advantages.
ADO.NET Architecture
Data processing has traditionally relied primarily on a connection-based, two-tier model. As data
processing increasingly uses multi-tier architectures, programmers are switching to a
disconnected approach to provide better scalability for their applications.
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies
AN ENTROPIC OPTIMIZATION TECHNIQUE IN HETEROGENEOUS GRID COMPUTING USING BION...ijcsit
The wide usage of the Internet and the availability of powerful computers and high-speed networks as low cost
commodity components have a deep impact on the way we use computers today, in such a way that
these technologies facilitated the usage of multi-owner and geographically distributed resources to address
large-scale problems in many areas such as science, engineering, and commerce. The new paradigm of
Grid computing has evolved from these researches on these topics. Performance and utilization of the grid
depends on a complex and excessively dynamic procedure of optimally balancing the load among the
available nodes. In this paper, we suggest a novel two-dimensional figure of merit that depict the network
effects on load balance and fault tolerance estimation to improve the performance of the network
utilizations. The enhancement of fault tolerance is obtained by adaptively decrease replication time and
message cost. On the other hand, load balance is improved by adaptively decrease mean job response time.
Finally, analysis of Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization is
conducted with regards to their solutions, issues and improvements concerning load balancing in
computational grid. Consequently, a significant system utilization improvement was attained. Experimental
results eventually demonstrate that the proposed method's performance surpasses other methods.
Possible Worlds Explorer: Datalog & Answer Set Programming for the Rest of UsBertram Ludäscher
Sahil Gupta, Bertram Ludäscher, Jessica Yi-Yun Cheng.
Datalog 2.0: 3rd Workshop on the Resurgence of Datalog in Academia & Industry. Philadelphia Logic Week. June 3-7, 2019 Philadelphia.
An Efficient PDP Scheme for Distributed Cloud StorageIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Privacy Preserving MFI Based Similarity Measure For Hierarchical Document Clu...IJORCS
The increasing nature of World Wide Web has imposed great challenges for researchers in improving the search efficiency over the internet. Now days web document clustering has become an important research topic to provide most relevant documents in huge volumes of results returned in response to a simple query. In this paper, first we proposed a novel approach, to precisely define clusters based on maximal frequent item set (MFI) by Apriori algorithm. Afterwards utilizing the same maximal frequent item set (MFI) based similarity measure for Hierarchical document clustering. By considering maximal frequent item sets, the dimensionality of document set is decreased. Secondly, providing privacy preserving of open web documents is to avoiding duplicate documents. There by we can protect the privacy of individual copy rights of documents. This can be achieved using equivalence relation.
A h k clustering algorithm for high dimensional data using ensemble learningijitcs
Advances made to the traditional clustering algorithms solves the various problems such as curse of
dimensionality and sparsity of data for multiple attributes. The traditional H-K clustering algorithm can
solve the randomness and apriority of the initial centers of K-means clustering algorithm. But when we
apply it to high dimensional data it causes the dimensional disaster problem due to high computational
complexity. All the advanced clustering algorithms like subspace and ensemble clustering algorithms
improve the performance for clustering high dimension dataset from different aspects in different extent.
Still these algorithms will improve the performance form a single perspective. The objective of the
proposed model is to improve the performance of traditional H-K clustering and overcome the limitations
such as high computational complexity and poor accuracy for high dimensional data by combining the
three different approaches of clustering algorithm as subspace clustering algorithm and ensemble
clustering algorithm with H-K clustering algorithm.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Introduction to Multi-Objective Clustering EnsembleIJSRD
Association rule mining is a popular and well researched method for discovering interesting relations between variables in large databases. In this paper we introduce the concept of Data mining, Association rule and Multilevel association rule with different algorithm, its advantage and concept of Fuzzy logic and Genetic Algorithm. Multilevel association rules can be mined efficiently using concept hierarchies under a support-confidence framework.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Privacy Preserved Distributed Data Sharing with Load Balancing SchemeEditor IJMTER
Data sharing services are provided under the Peer to Peer (P2P) environment. Federated
database technology is used to manage locally stored data with a federated DBMS and provide unified
data access. Information brokering systems (IBSs) are used to connect large-scale loosely federated data
sources via a brokering overlay. Information brokers redirect the client queries to the requested data
servers. Privacy preserving methods are used to protect the data location and data consumer. Brokers are
trusted to adopt server-side access control for data confidentiality. Query and access control rules are
maintained with shared data details under metadata. A Semantic-aware index mechanism is applied to
route the queries based on their content and allow users to submit queries without data or server
information.
Distributed data sharing is managed with Privacy Preserved Information Brokering (PPIB)
scheme. Attribute-correlation attack and inference attacks are handled by the PPIB. PPIB overlay
infrastructure consisting of two types of brokering components, brokers and coordinators. The brokers
acts as mix anonymizer are responsible for user authentication and query forwarding. The coordinators
concatenated in a tree structure, enforce access control and query routing based on the automata.
Automata segmentation and query segment encryption schemes are used in the Privacy-preserving
Query Brokering (QBroker). Automaton segmentation scheme is used to logically divide the global
automaton into multiple independent segments. The query segment encryption scheme consists of the
preencryption and postencryption modules.
The PPIB scheme is enhanced to support dynamic site distribution and load balancing
mechanism. Peer workloads and trust level of each peer are integrated with the site distribution process.
The PPIB is improved to adopt self reconfigurable mechanism. Automated decision support system for
administrators is included in the PPIB.
Diario de Ávila - Las personas con estudios superiores gastan más en alcoholEAE Business School
Artículo publicado en el Diario de Ávila que hace referencia a un estudio sobre el consumo de alcohol, tabaco y el juego realizado por EAE Business School.
Image Thumbnail with Blur and Noise Information to Improve Browsing ExperienceWaqas Tariq
Image thumbnail is used by many state-of-the-art consumer electronic products, such as digital camera, smart phone, and camcorder. Image thumbnail, which is a smaller image version of the original image, helps the user to inspect the general objects’ composition contained in the acquired image. However, it is difficult to embed blur information inside the thumbnail, which will improve significantly the user’s satisfaction in taking pictures. Therefore, in this paper, a new method to embed blur information inside the thumbnail is proposed. This method uses two small images, which are the directly down-sampled image, and the smoothed version of it. This method is simple to be implemented and its sensitivity towards blur and noise can be adjusted.
Posizionamento nei motori di ricerca: non ci sono trucchi!Marco Domizio
I trucchi per il posizionamento su Google e altri motori non esistono. O meglio, esistono, ma sono inutilizzabili.
Se vuoi portare il tuo sito in prima pagina sui motori, occorre fare un lavoro specifico per il posizionamento sui motori di ricerca, come la realizzazione di una buona struttura interna del sito, e la conoscenza approfondita delle tecniche SEO, che riescono a far "trovare" ai motori di ricerca ciò che si aspetterebbero di vedere in una determinata pagina web.
AN ENTROPIC OPTIMIZATION TECHNIQUE IN HETEROGENEOUS GRID COMPUTING USING BION...ijcsit
The wide usage of the Internet and the availability of powerful computers and high-speed networks as low cost
commodity components have a deep impact on the way we use computers today, in such a way that
these technologies facilitated the usage of multi-owner and geographically distributed resources to address
large-scale problems in many areas such as science, engineering, and commerce. The new paradigm of
Grid computing has evolved from these researches on these topics. Performance and utilization of the grid
depends on a complex and excessively dynamic procedure of optimally balancing the load among the
available nodes. In this paper, we suggest a novel two-dimensional figure of merit that depict the network
effects on load balance and fault tolerance estimation to improve the performance of the network
utilizations. The enhancement of fault tolerance is obtained by adaptively decrease replication time and
message cost. On the other hand, load balance is improved by adaptively decrease mean job response time.
Finally, analysis of Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization is
conducted with regards to their solutions, issues and improvements concerning load balancing in
computational grid. Consequently, a significant system utilization improvement was attained. Experimental
results eventually demonstrate that the proposed method's performance surpasses other methods.
Possible Worlds Explorer: Datalog & Answer Set Programming for the Rest of UsBertram Ludäscher
Sahil Gupta, Bertram Ludäscher, Jessica Yi-Yun Cheng.
Datalog 2.0: 3rd Workshop on the Resurgence of Datalog in Academia & Industry. Philadelphia Logic Week. June 3-7, 2019 Philadelphia.
An Efficient PDP Scheme for Distributed Cloud StorageIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Privacy Preserving MFI Based Similarity Measure For Hierarchical Document Clu...IJORCS
The increasing nature of World Wide Web has imposed great challenges for researchers in improving the search efficiency over the internet. Now days web document clustering has become an important research topic to provide most relevant documents in huge volumes of results returned in response to a simple query. In this paper, first we proposed a novel approach, to precisely define clusters based on maximal frequent item set (MFI) by Apriori algorithm. Afterwards utilizing the same maximal frequent item set (MFI) based similarity measure for Hierarchical document clustering. By considering maximal frequent item sets, the dimensionality of document set is decreased. Secondly, providing privacy preserving of open web documents is to avoiding duplicate documents. There by we can protect the privacy of individual copy rights of documents. This can be achieved using equivalence relation.
A h k clustering algorithm for high dimensional data using ensemble learningijitcs
Advances made to the traditional clustering algorithms solves the various problems such as curse of
dimensionality and sparsity of data for multiple attributes. The traditional H-K clustering algorithm can
solve the randomness and apriority of the initial centers of K-means clustering algorithm. But when we
apply it to high dimensional data it causes the dimensional disaster problem due to high computational
complexity. All the advanced clustering algorithms like subspace and ensemble clustering algorithms
improve the performance for clustering high dimension dataset from different aspects in different extent.
Still these algorithms will improve the performance form a single perspective. The objective of the
proposed model is to improve the performance of traditional H-K clustering and overcome the limitations
such as high computational complexity and poor accuracy for high dimensional data by combining the
three different approaches of clustering algorithm as subspace clustering algorithm and ensemble
clustering algorithm with H-K clustering algorithm.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Introduction to Multi-Objective Clustering EnsembleIJSRD
Association rule mining is a popular and well researched method for discovering interesting relations between variables in large databases. In this paper we introduce the concept of Data mining, Association rule and Multilevel association rule with different algorithm, its advantage and concept of Fuzzy logic and Genetic Algorithm. Multilevel association rules can be mined efficiently using concept hierarchies under a support-confidence framework.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Privacy Preserved Distributed Data Sharing with Load Balancing SchemeEditor IJMTER
Data sharing services are provided under the Peer to Peer (P2P) environment. Federated
database technology is used to manage locally stored data with a federated DBMS and provide unified
data access. Information brokering systems (IBSs) are used to connect large-scale loosely federated data
sources via a brokering overlay. Information brokers redirect the client queries to the requested data
servers. Privacy preserving methods are used to protect the data location and data consumer. Brokers are
trusted to adopt server-side access control for data confidentiality. Query and access control rules are
maintained with shared data details under metadata. A Semantic-aware index mechanism is applied to
route the queries based on their content and allow users to submit queries without data or server
information.
Distributed data sharing is managed with Privacy Preserved Information Brokering (PPIB)
scheme. Attribute-correlation attack and inference attacks are handled by the PPIB. PPIB overlay
infrastructure consisting of two types of brokering components, brokers and coordinators. The brokers
acts as mix anonymizer are responsible for user authentication and query forwarding. The coordinators
concatenated in a tree structure, enforce access control and query routing based on the automata.
Automata segmentation and query segment encryption schemes are used in the Privacy-preserving
Query Brokering (QBroker). Automaton segmentation scheme is used to logically divide the global
automaton into multiple independent segments. The query segment encryption scheme consists of the
preencryption and postencryption modules.
The PPIB scheme is enhanced to support dynamic site distribution and load balancing
mechanism. Peer workloads and trust level of each peer are integrated with the site distribution process.
The PPIB is improved to adopt self reconfigurable mechanism. Automated decision support system for
administrators is included in the PPIB.
Diario de Ávila - Las personas con estudios superiores gastan más en alcoholEAE Business School
Artículo publicado en el Diario de Ávila que hace referencia a un estudio sobre el consumo de alcohol, tabaco y el juego realizado por EAE Business School.
Image Thumbnail with Blur and Noise Information to Improve Browsing ExperienceWaqas Tariq
Image thumbnail is used by many state-of-the-art consumer electronic products, such as digital camera, smart phone, and camcorder. Image thumbnail, which is a smaller image version of the original image, helps the user to inspect the general objects’ composition contained in the acquired image. However, it is difficult to embed blur information inside the thumbnail, which will improve significantly the user’s satisfaction in taking pictures. Therefore, in this paper, a new method to embed blur information inside the thumbnail is proposed. This method uses two small images, which are the directly down-sampled image, and the smoothed version of it. This method is simple to be implemented and its sensitivity towards blur and noise can be adjusted.
Posizionamento nei motori di ricerca: non ci sono trucchi!Marco Domizio
I trucchi per il posizionamento su Google e altri motori non esistono. O meglio, esistono, ma sono inutilizzabili.
Se vuoi portare il tuo sito in prima pagina sui motori, occorre fare un lavoro specifico per il posizionamento sui motori di ricerca, come la realizzazione di una buona struttura interna del sito, e la conoscenza approfondita delle tecniche SEO, che riescono a far "trovare" ai motori di ricerca ciò che si aspetterebbero di vedere in una determinata pagina web.
Very few research works have been done on XML security over relational databases despite that XML became the de facto standard for the data representation and exchange on the internet and a lot of XML documents are stored in RDBMS. In [14], the author proposed an access control model for schema-based storage of XML documents in relational storage and translating XML access control rules to relational access control rules. However, the proposed algorithms had performance drawbacks. In this paper, we will use the same access control model of [14] and try to overcome the drawbacks of [14] by proposing an efficient technique to store the XML access control rules in a relational storage of XML DTD. The mapping of the XML DTD to relational schema is proposed in [7]. We also propose an algorithm to translate XPath queries to SQL queries based on the mapping algorithm in [7].
Very few research works have been done on XML security over relational databases despite that XML
became the de facto standard for the data representation and exchange on the internet and a lot of XML
documents are stored in RDBMS. In [14], the author proposed an access control model for schema-based
storage of XML documents in relational storage and translating XML access control rules to relational
access control rules. However, the proposed algorithms had performance drawbacks. In this paper, we will
use the same access control model of [14] and try to overcome the drawbacks of [14] by proposing an
efficient technique to store the XML access control rules in a relational storage of XML DTD. The mapping
of the XML DTD to relational schema is proposed in [7]. We also propose an algorithm to translate XPath
queries to SQL queries based on the mapping algorithm in [7].
XML COMPACTION IMPROVEMENTS BASED ON BINARY STRING ENCODINGSijdms
Due to the flexibility and the easy use of XML, it is nowadays widely used in a vast number of application areas and new information is increasingly being encoded as XML documents. Therefore, it is important to provide a repository for XML documents, which supports efficient management and storage of XML data.For this purpose, many proposals have been made, the most common ones are node labeling schemes. On
the other hand, XML repeatedly uses tags to describe the data itself. This self-describing nature of XML makes it verbose with the result that the storage requirements of XML are often expanded and can be excessive. In addition, the increased size leads to increased costs for data manipulation. Therefore, it also seems natural to use compression techniques to increase the efficiency of storing and querying XML data.
In our previous works, we aimed at combining the advantages of both areas (labeling and compaction technologies), Specially, we took advantage of XML structural peculiarities for attempting to reduce storage space requirements and to improve the efficiency of XML query processing using labeling schemes. In this paper, we continue our investigations on variations of binary string encoding forms to decrease the
label size. Also We report the experimental results to examine the impact of binary string encoding on the query performance and the storage size needed to store the compacted XML documents.
INVESTIGATING BINARY STRING ENCODING FOR COMPACT REPRESENTATION OF XML DOCUMENTScsandit
Since Extensible Markup Language abbreviated as XML, became an official World Wide Web
Consortium recommendation in 1998, XML has emerged as the predominant mechanism for
data storage and exchange, in particular over the World Web. Due to the flexibility and the easy
use of XML, it is nowadays widely used in a vast number of application areas and new
information is increasingly being encoded as XML documents. Because of the widespread use of
XML and the large amounts of data that are represented in XML, it is therefore important to
provide a repository for XML documents, which supports efficient management and storage of
XML data. Since the logical structure of an XML document is an ordered tree consisting of tree
nodes, establishing a relationship between nodes is essential for processing the structural part
of the queries. Therefore, tree navigation is essential to answer XML queries. For this purpose,
many proposals have been made, the most common ones are node labeling schemes. On the
other hand, XML repeatedly uses tags to describe the data itself. This self-describing nature of
XML makes it verbose with the result that the storage requirements of XML are often expanded
and can be excessive. In addition, the increased size leads to increased costs for data
manipulation. Therefore, it also seems natural to use compression techniques to increase the
efficiency of storing and querying XML data. In our previous works, we aimed at combining the
advantages of both areas (labeling and compaction technologies), Specially, we took advantage
of XML structural peculiarities for attempting to reduce storage space requirements and to
improve the efficiency of XML query processing using labeling schemes. In this paper, we
continue our investigations on variations of binary string encoding forms to decrease the label
size. Also We report the experimental results to examine the impact of binary string encoding on
reducing the storage size needed to store the compacted XML documents.
Transforming data-centric eXtensible markup language into relational database...journalBEEI
eXtensible markup language (XML) appeared internationally as the format for data representation over the web. Yet, most organizations are still utilising relational databases as their database solutions. As such, it is crucial to provide seamless integration via effective transformation between these database infrastructures. In this paper, we propose XML-REG to bridge these two technologies based on node-based and path-based approaches. The node-based approach is good to annotate each positional node uniquely, while the path-based approach provides summarised path information to join the nodes. On top of that, a new range labelling is also proposed to annotate nodes uniquely by ensuring the structural relationships are maintained between nodes. If a new node is to be added to the document, re-labelling is not required as the new label will be assigned to the node via the new proposed labelling scheme. Experimental evaluations indicated that the performance of XML-REG exceeded XMap, XRecursive, XAncestor and Mini-XML concerning storing time, query retrieval time and scalability. This research produces a core framework for XML to relational databases (RDB) mapping, which could be adopted in various industries.
Efficient & Lock-Free Modified Skip List in Concurrent EnvironmentEditor IJCATR
In this era the trend of increasing software demands continues consistently, the traditional approach of faster processes comes to an end, forcing major processor manufactures to turn to multi-threading and multi-core architectures, in what is called the concurrency revolution. At the heart of many concurrent applications lie concurrent data structures. Concurrent data structures coordinate access to shared resources; implementing them is hard. The main goal of this paper is to provide an efficient and practical lock-free implementation of modified skip list data structure. That is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. The algorithms for concurrent MSL based on mutual exclusion, Causes blocking which has several drawbacks and degrades the system’s overall performance. Non-blocking algorithms avoid blocking, and are either lock-free or wait-free.
D
ata validation is
becoming
more and more
important
w
ith the ever
-
growing amount of data being
consumed a
nd transmitted by systems over the Internet. It is important to ensure that the data being sent is
valid as
it
may cont
ain entry
errors, which
may be
consumed
by different systems
causing further errors
.
XML has become the defacto standard for data transfe
r. The XML Schema Definition language (XSD) was
created to help XML
structural
validation and provide a schema for data type restrictions, however it does
not allow for more complex
situations
. In this article we
introduce a way to provide rule based XML
v
alidation
and correction
through the extension
and improve
ment of our SRML metalanguage.
We also
explore the option of
applying it in
a database as a trig
ger for CRUD
operations
allowing
more granular
data
set
validation
on an ato
mic level
allow
ing
for more
com
plex
dataset record
validation rules
Extracting interesting knowledge from versions of dynamic xml documentseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Extracting interesting knowledge from versions of dynamic xml documentseSAT Journals
Abstract XML has became very popular for representing semi structured data and a standard for data exchange over the web these days. The data exchanged as XML is growing continuously, so the necessity to not only store these large volumes of XML data for future use, but to mine them to discover interesting information has became obvious. The extracted knowledge can be used to make predictions. Recently, a large amount of work has been done in XML data mining. Most of the existing work focuses on the static XML data mining, while XML data is dynamic in real applications. So research has been focused more on XML documents versions and extracting information from versions of XML documents. Approach proposed in this paper is for mining association rules from changes of versions of dynamic XML documents by using information present in the consolidated delta which can be used for making future predictions. Index Terms: XML, Dynamic XML documents, Association Rule mining for XML
Expression of Query in XML object-oriented databaseEditor IJCATR
Upon invent of object-oriented database, the concept of behavior in database was propounded. Before, relational database only provided a logical modeling of data and paid no attention to the operations applied on data in the system. In this paper, a method is presented for query of object-oriented database. This method has appropriate results when the user explains restrictions in a combinational matter (disjunctive and conjunctive) and assumes a weight for each one of restrictions based on their importance. Later, the obtained results are sorted based on their belonging rate to the response set. In continue, queries are explained using XML labels. The purpose is simplifying queries and objects resulted from queries to be very close to the user need and meet his expectation.
Expression of Query in XML object-oriented databaseEditor IJCATR
Upon invent of object-oriented database, the concept of behavior in database was propounded. Before, relational database
only provided a logical modeling of data and paid no attention to the operations applied on data in the system. In this paper, a method
is presented for query of object-oriented database. This method has appropriate results when the user explains restrictions in a
combinational matter (disjunctive and conjunctive) and assumes a weight for each one of restrictions based on their importance. Later,
the obtained results are sorted based on their belonging rate to the response set. In continue, queries are explained using XML labels.
The purpose is simplifying queries and objects resulted from queries to be very close to the user need and meet his expectation.
Expression of Query in XML object-oriented databaseEditor IJCATR
Upon invent of object-oriented database, the concept of behavior in database was propounded. Before, relational database
only provided a logical modeling of data and paid no attention to the operations applied on data in the system. In this paper, a method
is presented for query of object-oriented database. This method has appropriate results when the user explains restrictions in a
combinational matter (disjunctive and conjunctive) and assumes a weight for each one of restrictions based on their importance. Later,
the obtained results are sorted based on their belonging rate to the response set. In continue, queries are explained using XML labels.
The purpose is simplifying queries and objects resulted from queries to be very close to the user need and meet his expectation.
While the world is witnessing an information revolution unprecedented and great speed in the growth of databases in all aspects. Databases interconnect with their content and schema but use different elements and structures to express the same concepts and relations, which may cause semantic and structural conflicts. This paper proposes a new technique for integration the heterogeneous eXtensible Markup Language (XML) schemas, under the name XDEHD. The returned mediated schema contains all concepts and relations of the sources without duplication. Detailed technique divides into three steps; First, extract all subschemas from the sources by decompose the schemas sources, each subschema contains three levels, these levels are ancestor, root and leaf. Thereafter, second, the technique matches and compares the subschemas and return the related candidate subschemas, semantic closeness function is implemented to measures the degree how similar the concepts of subschemas are modelled in the sources. Finally, create the medicate schema by integration the candidate subschemas, and then obtain the minimal and complete unified schema, association strength function is developed to compute closely of pair in candidate subschema across all data sources, and elements repetition function is employed to calculate how many times each element repeated between the candidate subschema.
Mapping of extensible markup language-to-ontology representation for effectiv...IAESIJAI
Extensible markup language (XML) is well-known as the standard for data exchange over the internet. It is flexible and has high expressibility to express the relationship between the data stored. Yet, the structural complexity and the semantic relationships are not well expressed. On the other hand, ontology models the structural, semantic and domain knowledge effectively. By combining ontology with visualization effect, one will be able to have a closer view based on respective user requirements. In this paper, we propose several mapping rules for the transformation of XML into ontology representation. Subsequently, we show how the ontology is constructed based on the proposed rules using the sample domain ontology in University of Wisconsin-Milwaukee (UWM) and mondial datasets. We
also look at the schemas, query workload, and evaluation, to derive the extended knowledge from the existing ontology. The correctness of the ontology representation has been proven effective through supporting various types of complex queries in simple protocol and resource description framework query language (SPARQL) language.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
Similar to Multi-GranularityUser Friendly List Locking Protocol for XML Repetitive Data (20)
The Use of Java Swing’s Components to Develop a WidgetWaqas Tariq
Widget is a kind of application provides a single service such as a map, news feed, simple clock, battery-life indicators, etc. This kind of interactive software object has been developed to facilitate user interface (UI) design. A user interface (UI) function may be implemented using different widgets with the same function. In this article, we present the widget as a platform that is generally used in various applications, such as in desktop, web browser, and mobile phone. We also describe a visual menu of Java Swing’s components that will be used to establish widget. It will assume that we have successfully compiled and run a program that uses Swing components.
3D Human Hand Posture Reconstruction Using a Single 2D ImageWaqas Tariq
Passive sensing of the 3D geometric posture of the human hand has been studied extensively over the past decade. However, these research efforts have been hampered by the computational complexity caused by inverse kinematics and 3D reconstruction. In this paper, our objective focuses on 3D hand posture estimation based on a single 2D image with aim of robotic applications. We introduce the human hand model with 27 degrees of freedom (DOFs) and analyze some of its constraints to reduce the DOFs without any significant degradation of performance. A novel algorithm to estimate the 3D hand posture from eight 2D projected feature points is proposed. Experimental results using real images confirm that our algorithm gives good estimates of the 3D hand pose. Keywords: 3D hand posture estimation; Model-based approach; Gesture recognition; human- computer interface; machine vision.
Camera as Mouse and Keyboard for Handicap Person with Troubleshooting Ability...Waqas Tariq
Camera mouse has been widely used for handicap person to interact with computer. The utmost important of the use of camera mouse is must be able to replace all roles of typical mouse and keyboard. It must be able to provide all mouse click events and keyboard functions (include all shortcut keys) when it is used by handicap person. Also, the use of camera mouse must allow users troubleshooting by themselves. Moreover, it must be able to eliminate neck fatigue effect when it is used during long period. In this paper, we propose camera mouse system with timer as left click event and blinking as right click event. Also, we modify original screen keyboard layout by add two additional buttons (button “drag/ drop” is used to do drag and drop of mouse events and another button is used to call task manager (for troubleshooting)) and change behavior of CTRL, ALT, SHIFT, and CAPS LOCK keys in order to provide shortcut keys of keyboard. Also, we develop recovery method which allows users go from camera and then come back again in order to eliminate neck fatigue effect. The experiments which involve several users have been done in our laboratory. The results show that the use of our camera mouse able to allow users do typing, left and right click events, drag and drop events, and troubleshooting without hand. By implement this system, handicap person can use computer more comfortable and reduce the dryness of eyes.
A Proposed Web Accessibility Framework for the Arab DisabledWaqas Tariq
The Web is providing unprecedented access to information and interaction for people with disabilities. This paper presents a Web accessibility framework which offers the ease of the Web accessing for the disabled Arab users and facilitates their lifelong learning as well. The proposed framework system provides the disabled Arab user with an easy means of access using their mother language so they don’t have to overcome the barrier of learning the target-spoken language. This framework is based on analyzing the web page meta-language, extracting its content and reformulating it in a suitable format for the disabled users. The basic objective of this framework is supporting the equal rights of the Arab disabled people for their access to the education and training with non disabled people. Key Words : Arabic Moon code, Arabic Sign Language, Deaf, Deaf-blind, E-learning Interactivity, Moon code, Web accessibility , Web framework , Web System, WWW.
Real Time Blinking Detection Based on Gabor FilterWaqas Tariq
New method of blinking detection is proposed. The utmost important of blinking detections method is robust against different users, noise, and also change of eye shape. In this paper, we propose blinking detections method by measuring of distance between two arcs of eye (upper part and lower part). We detect eye arcs by apply Gabor filter onto eye image. As we know that Gabor filter has advantage on image processing application since it able to extract spatial localized spectral features, such line, arch, and other shape are more easily detected. After two of eye arcs are detected, we measure the distance between both by using connected labeling method. The open eye is marked by the distance between two arcs is more than threshold and otherwise, the closed eye is marked by the distance less than threshold. The experiment result shows that our proposed method robust enough against different users, noise, and eye shape changes with perfectly accuracy.
Computer Input with Human Eyes-Only Using Two Purkinje Images Which Works in ...Waqas Tariq
A method for computer input with human eyes-only using two Purkinje images which works in a real time basis without calibration is proposed. Experimental results shows that cornea curvature can be estimated by using two light sources derived Purkinje images so that no calibration for reducing person-to-person difference of cornea curvature. It is found that the proposed system allows usersf movements of 30 degrees in roll direction and 15 degrees in pitch direction utilizing detected face attitude which is derived from the face plane consisting three feature points on the face, two eyes and nose or mouth. Also it is found that the proposed system does work in a real time basis.
Toward a More Robust Usability concept with Perceived Enjoyment in the contex...Waqas Tariq
Mobile multimedia service is relatively new but has quickly dominated people¡¯s lives, especially among young people. To explain this popularity, this study applies and modifies the Technology Acceptance Model (TAM) to propose a research model and conduct an empirical study. The goal of study is to examine the role of Perceived Enjoyment (PE) and what determinants can contribute to PE in the context of using mobile multimedia service. The result indicates that PE is influencing on Perceived Usefulness (PU) and Perceived Ease of Use (PEOU) and directly Behavior Intention (BI). Aesthetics and flow are key determinants to explain Perceived Enjoyment (PE) in mobile multimedia usage.
Collaborative Learning of Organisational KnolwedgeWaqas Tariq
This paper presents recent research into methods used in Australian Indigenous Knowledge sharing and looks at how these can support the creation of suitable collaborative envi- ronments for timely organisational learning. The protocols and practices as used today and in the past by Indigenous communities are presented and discussed in relation to their relevance to a personalised system of knowledge sharing in modern organisational cultures. This research focuses on user models, knowledge acquisition and integration of data for constructivist learning in a networked repository of or- ganisational knowledge. The data collected in the repository is searched to provide collections of up-to-date and relevant material for training in a work environment. The aim is to improve knowledge collection and sharing in a team envi- ronment. This knowledge can then be collated into a story or workflow that represents the present knowledge in the organisation.
Our research aims to propose a global approach for specification, design and verification of context awareness Human Computer Interface (HCI). This is a Model Based Design approach (MBD). This methodology describes the ubiquitous environment by ontologies. OWL is the standard used for this purpose. The specification and modeling of Human-Computer Interaction are based on Petri nets (PN). This raises the question of representation of Petri nets with XML. We use for this purpose, the standard of modeling PNML. In this paper, we propose an extension of this standard for specification, generation and verification of HCI. This extension is a methodological approach for the construction of PNML with Petri nets. The design principle uses the concept of composition of elementary structures of Petri nets as PNML Modular. The objective is to obtain a valid interface through verification of properties of elementary Petri nets represented with PNML.
Development of Sign Signal Translation System Based on Altera’s FPGA DE2 BoardWaqas Tariq
The main aim of this paper is to build a system that is capable of detecting and recognizing the hand gesture in an image captured by using a camera. The system is built based on Altera’s FPGA DE2 board, which contains a Nios II soft core processor. Image processing techniques and a simple but effective algorithm are implemented to achieve this purpose. Image processing techniques are used to smooth the image in order to ease the subsequent processes in translating the hand sign signal. The algorithm is built for translating the numerical hand sign signal and the result are displayed on the seven segment display. Altera’s Quartus II, SOPC Builder and Nios II EDS software are used to construct the system. By using SOPC Builder, the related components on the DE2 board can be interconnected easily and orderly compared to traditional method that requires lengthy source code and time consuming. Quartus II is used to compile and download the design to the DE2 board. Then, under Nios II EDS, C programming language is used to code the hand sign translation algorithm. Being able to recognize the hand sign signal from images can helps human in controlling a robot and other applications which require only a simple set of instructions provided a CMOS sensor is included in the system.
An overview on Advanced Research Works on Brain-Computer InterfaceWaqas Tariq
A brain–computer interface (BCI) is a proficient result in the research field of human- computer synergy, where direct articulation between brain and an external device occurs resulting in augmenting, assisting and repairing human cognitive. Advanced works like generating brain-computer interface switch technologies for intermittent (or asynchronous) control in natural environments or developing brain-computer interface by Fuzzy logic Systems or by implementing wavelet theory to drive its efficacies are still going on and some useful results has also been found out. The requirements to develop this brain machine interface is also growing day by day i.e. like neuropsychological rehabilitation, emotion control, etc. An overview on the control theory and some advanced works on the field of brain machine interface are shown in this paper.
Exploring the Relationship Between Mobile Phone and Senior Citizens: A Malays...Waqas Tariq
There is growing ageing phenomena with the rise of ageing population throughout the world. According to the World Health Organization (2002), the growing ageing population indicates 694 million, or 223% is expected for people aged 60 and over, since 1970 and 2025.The growth is especially significant in some advanced countries such as North America, Japan, Italy, Germany, United Kingdom and so forth. This growing older adult population has significantly impact the social-culture, lifestyle, healthcare system, economy, infrastructure and government policy of a nation. However, there are limited research studies on the perception and usage of a mobile phone and its service for senior citizens in a developing nation like Malaysia. This paper explores the relationship between mobile phones and senior citizens in Malaysia from the perspective of a developing country. We conducted an exploratory study using contextual interviews with 5 senior citizens of how they perceive their mobile phones. This paper reveals 4 interesting themes from this preliminary study, in addition to the findings of the desirable mobile requirements for local senior citizens with respect of health, safety and communication purposes. The findings of this study bring interesting insight to local telecommunication industries as a whole, and will also serve as groundwork for more in-depth study in the future.
Principles of Good Screen Design in WebsitesWaqas Tariq
Visual techniques for proper arrangement of the elements on the user screen have helped the designers to make the screen look good and attractive. Several visual techniques emphasize the arrangement and ordering of the screen elements based on particular criteria for best appearance of the screen. This paper investigates few significant visual techniques in various web user interfaces and showcases the results for better understanding and their presence.
Virtual teams are used more and more by companies and other organizations to receive benefits. They are a great way to enable teamwork in situations where people are not sitting in the same physical place at the same time. As companies seek to increase the use of virtual teams, a need exists to explore the context of these teams, the virtuality of a team and software that may help these teams working virtualy. Virtual teams have the same basic principles as traditional teams, but there is one big difference. This difference is the way the team members communicate. Instead of using the dynamics of in-office face-to-face exchange, they now rely on special communication channels enabled by modern technologies, such as e-mails, faxes, phone calls and teleconferences, virtual meetings etc. This is why this paper is focused on the issues regarding virtual teams, and how these teams are created and progressing in Albania.
Cognitive Approach Towards the Maintenance of Web-Sites Through Quality Evalu...Waqas Tariq
It is a well established fact that the Web-Applications require frequent maintenance because of cutting– edge business competitions. The authors have worked on quality evaluation of web-site of Indian ecommerce domain. As a result of that work they have made a quality-wise ranking of these sites. According to their work and also the survey done by various other groups Futurebazaar web-site is considered to be one of the best Indian e-shopping sites. In this research paper the authors are assessing the maintenance of the same site by incorporating the problems incurred during this evaluation. This exercise gives a real world maintainability problem of web-sites. This work will give a clear picture of all the quality metrics which are directly or indirectly related with the maintainability of the web-site.
USEFul: A Framework to Mainstream Web Site Usability through Automated Evalua...Waqas Tariq
A paradox has been observed whereby web site usability is proven to be an essential element in a web site, yet at the same time there exist an abundance of web pages with poor usability. This discrepancy is the result of limitations that are currently preventing web developers in the commercial sector from producing usable web sites. In this paper we propose a framework whose objective is to alleviate this problem by automating certain aspects of the usability evaluation process. Mainstreaming comes as a result of automation, therefore enabling a non-expert in the field of usability to conduct the evaluation. This results in reducing the costs associated with such evaluation. Additionally, the framework allows the flexibility of adding, modifying or deleting guidelines without altering the code that references them since the guidelines and the code are two separate components. A comparison of the evaluation results carried out using the framework against published evaluations of web sites carried out by web site usability professionals reveals that the framework is able to automatically identify the majority of usability violations. Due to the consistency with which it evaluates, it identified additional guideline-related violations that were not identified by the human evaluators.
Robot Arm Utilized Having Meal Support System Based on Computer Input by Huma...Waqas Tariq
A robot arm utilized having meal support system based on computer input by human eyes only is proposed. The proposed system is developed for handicap/disabled persons as well as elderly persons and tested with able persons with several shapes and size of eyes under a variety of illumination conditions. The test results with normal persons show the proposed system does work well for selection of the desired foods and for retrieve the foods as appropriate as usersf requirements. It is found that the proposed system is 21% much faster than the manually controlled robotics.
Dynamic Construction of Telugu Speech Corpus for Voice Enabled Text EditorWaqas Tariq
In recent decades speech interactive systems have gained increasing importance. Performance of an ASR system mainly depends on the availability of large corpus of speech. The conventional method of building a large vocabulary speech recognizer for any language uses a top-down approach to speech. This approach requires large speech corpus with sentence or phoneme level transcription of the speech utterances. The transcriptions must also include different speech order so that the recognizer can build models for all the sounds present. But, for Telugu language, because of its complex nature, a very large, well annotated speech database is very difficult to build. It is very difficult, if not impossible, to cover all the words of any Indian language, where each word may have thousands and millions of word forms. A significant part of grammar that is handled by syntax in English (and other similar languages) is handled within morphology in Telugu. Phrases including several words (that is, tokens) in English would be mapped on to a single word in Telugu.Telugu language is phonetic in nature in addition to rich in morphology. That is why the speech technology developed for English cannot be applied to Telugu language. This paper highlights the work carried out in an attempt to build a voice enabled text editor with capability of automatic term suggestion. Main claim of the paper is the recognition enhancement process developed by us for suitability of highly inflecting, rich morphological languages. This method results in increased speech recognition accuracy with very much reduction in corpus size. It also adapts Telugu words to the database dynamically, resulting in growth of the corpus.
An Improved Approach for Word Ambiguity RemovalWaqas Tariq
Word ambiguity removal is a task of removing ambiguity from a word, i.e. correct sense of word is identified from ambiguous sentences. This paper describes a model that uses Part of Speech tagger and three categories for word sense disambiguation (WSD). Human Computer Interaction is very needful to improve interactions between users and computers. For this, the Supervised and Unsupervised methods are combined. The WSD algorithm is used to find the efficient and accurate sense of a word based on domain information. The accuracy of this work is evaluated with the aim of finding best suitable domain of word. Keywords: Human Computer Interaction, Supervised Training, Unsupervised Learning, Word Ambiguity, Word sense disambiguation
Parameters Optimization for Improving ASR Performance in Adverse Real World N...Waqas Tariq
From the existing research it has been observed that many techniques and methodologies are available for performing every step of Automatic Speech Recognition (ASR) system, but the performance (Minimization of Word Error Recognition-WER and Maximization of Word Accuracy Rate- WAR) of the methodology is not dependent on the only technique applied in that method. The research work indicates that, performance mainly depends on the category of the noise, the level of the noise and the variable size of the window, frame, frame overlap etc is considered in the existing methods. The main aim of the work presented in this paper is to use variable size of parameters like window size, frame size and frame overlap percentage to observe the performance of algorithms for various categories of noise with different levels and also train the system for all size of parameters and category of real world noisy environment to improve the performance of the speech recognition system. This paper presents the results of Signal-to-Noise Ratio (SNR) and Accuracy test by applying variable size of parameters. It is observed that, it is really very hard to evaluate test results and decide parameter size for ASR performance improvement for its resultant optimization. Hence, this study further suggests the feasible and optimum parameter size using Fuzzy Inference System (FIS) for enhancing resultant accuracy in adverse real world noisy environmental conditions. This work will be helpful to give discriminative training of ubiquitous ASR system for better Human Computer Interaction (HCI). Keywords: ASR Performance, ASR Parameters Optimization, Multi-Environmental Training, Fuzzy Inference System for ASR, ubiquitous ASR system, Human Computer Interaction (HCI)
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Multi-GranularityUser Friendly List Locking Protocol for XML Repetitive Data
1. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 126
Multi-GranularityUser Friendly List Locking Protocol for XML
Repetitive Data
Eunjung Lee ejlee@kyonggi.ac.kr
Computer Science Department
Kyonggi University
Suwon, South Korea
Abstract
We proposeproposed a list data sharing model, which utilizes semantics expressed in DTD for
concurrency control of shared XML trees. In this model, tree updating actions such as inserting
and/or /deleting subtrees are allowed only for the repetitive parts. The proposed model
guarantees that the resulting XML tree is valid even when applying tree update actions are
applied concurrently. AlsoIn addition, we propose, a new multi-granularity locking mechanism
called list locking protocol is proposed. This protocol locks on the (index) list of repetitive children
nodes, so and thus it allows updates on to the descendents when the node's node child child’s
subtree is being deleted or inserted. This protocol is expected to show betterbe more accessible
accessibility with less number ofand to produce fewer locking objects on XML data compared to
the other locking methods on XML data. Moreover, the prototype system shows that list locking is
well suited to user interface of shared XML clients by enabling/disabling corresponding edit
operation controls.
Keywords: Locking, Shared XML, Repetition, Update.
1. INTRODUCTION
The rapid proliferation of the XML in many different application area areas results has resulted in
a rapidly growing number of XML documents. Also, it becomes and allowed more possible that
users workingwork concurrently on XML documents to share data. Isolating concurrent accesses
has become becomes an important issue in XML database (DB) systems or distributed
applications based on shared XML documents.1
Locking is the standard way to control concurrency in relational databasesDBs (RDBs). Multi-
granularity locking is used to resolve the tradeoff between concurrency and overhead [1]. Rather
than force a single locking granule for all transactions, multi-granularity allows a transaction to
select a granularity level at which to obtain locks. For XML trees, however, a multi-granule lock on
a node blocks the whole subtree and therefore reduces concurrency.
Recently, the topic of synchronization was picked up againreaddressed in the context of XML.
Several locking approaches are have been proposed for shared XML data, such as OO2PL [8]
and path lock [5]. Most of these researches research has focused on the performance of shared
query processing and, therefore concerns is mainly concerned with mainly on reading a large
number of nodes, rather than updating the tree structure, such as through subtree insertion and
/deletion.
In this paper, we investigate a new efficient locking protocol for synchronizing concurrent tree
structure update actions. Studying By studying many application examples, we found that
structure update actions on a shared XML tree usually applied apply to the repetitive parts of the
1
This work was supported by the GRRC program (GRRC Kyonggi 2011-B03) of Gyeonggi province. This
work was supported by the GRRC program(GRRC Kyonggi 20101-B03) of Gyeonggi province.
2. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 127
tree. This motivates us to propose a list data sharing model for XML data, which restricts
structure update actions only for the repetitive parts. The proposed model guarantees that the
resulting XML tree is valid after applying the application of concurrent tree update actions.
A new multi-granularity locking (MGL) mechanism (MGL), called the list locking protocol, is
proposed. This protocol locks on the (index) list of repetitive children nodes for handling the
concurrent insertion and /deletion of subtrees. This protocol allows update actions on
descendents during the insertion and deletion inserting/deletingof subtrees. List The list locking
protocol is expected to show better accessibilitybe more accessible and to produce with less
fewer number of locking objects for synchronizing structure update actions compared to the other
locking methods on XML data. Moreover, the prototype system shows that list locking is well
suited to user interface of shared XML clients by enabling/disabling corresponding edit operation
controls.
This paper is organized as follows. Section 2 discusses related work. Section 3 gives describes
the motivation for the development of our model. Section 4 describes our model of shared XML
data and the locking algorithm. In section 5, we discuss the proposed method compared with
previous methods. Finally, section 6 has ourdiscusses our conclusions and conclusion and future
work.
2. RELATED WORK
A multiMGL-granularity locking protocol protocols on RDBs as well as on Object-oriented DBs
(OODBs) is are a well well-established research area. Especially, it is studied, and particular
focus has been placed on OODBs using DAGs, which to allow locks on granules of groups of
objects. Lee et al. proposed a new MGL for composite objects [11], where in which collections of
objects can have arbitrary intersection and inclusion relationships.
An XML tree has a hierarchical structure, which that is not a DAG. The node relations could be a
general DAG if we use ID or IDREF attribute attributes are used as a relationrelations between
nodes. However, we consider XML trees as simple hierarchical structurestructures. Manipulating
shared actions on trees, tree locking considers shared trees with structure update actions [10]. It
is based on two- phase locking, which allows locks only on individual nodes. Also, Tthe tree
locking protocol does not allow for the deletion of deleting subtrees, but only simple nodes.
For allowing structure update actions, one of the most recent results studies on lock-based
synchronization for XML trees is OO2PL [7,8] proposed by Helmer et al. OO2PL considers
Considering structure updates as changing pointers between nodes, OO2PL and therefore locks
on the pointers. Because it uses low-level physical data structure as locking units, Their the
model is powerful enough to allow arbitrary type of node accesses access and structure updates
since it uses low level physical data structure as locking units. However, if the structure updates
on to XML trees should guarantee validity, then not all structure update actions we cannot allow
allcan be allowed structure update actions. Therefore, in our opinion, allowing a method that
allows any type of structure updates update, such as like OO2PL, is too general for a model
sharing model of XML trees. They Helmer et al. mentioned noted that using document document-
type information and validity to could enhance performance, but present presented only an
informal way to of using dummy nodes for repetitive parts.
Dekeyser and Hidders proposed a path lock [5], a new fine granularity locking scheme of fine
granularity based on path locks. They provide provided an algorithm to support general path
notations such as //A//B for accessing data. Their method could allow both top-down and bottom-
up query evaluation and locking, and therefore shows better efficiencyis more efficient. However,
The path lock method only supports the deletion of leaf nodes, however, and not thedoes not
support deletion of subtrees, either. Only deletion of leaf nodes is allowed. On the other
hand,However, Grab et al. proposed DGLOCK, which controls concurrent accesses using
predicates on data guide [6].
3. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 128
Recently, sSeveral recently published studies have shown implementations and their concurrency
issues have been published. They have shown that effective and efficient locking protocols are
essential to guarantee the ACID properties for XML processing and to achieve high transaction
throughput. Most native XML database systems adopt one or more of locking protocols [12,13,–
14]. However, we found that there are is still rooms room for improvement in concurrency
efficiency, especially for insert and /delete operations, since because most of the current
researches research are has focused on retrieval and data update operations. In this paper, we
aim to propose a new locking protocol which that is feasible for the a cooperation cooperative
environment with heavy a large number of insert and /delete operations.
3. MOTIVATION
In this section, we will look intoexamine sharing patterns in XML XML-based collaboration
collaborative applications. From this observation, weWe have found that structure update actions
such as subtree insertioninsertions and /deletions are often applied to repetitive parts in XML,
represented as with the symbol “*” in a DTD. This motivates us to propose a new model for XML
data sharing.
3.1 A Working Example
The following XML file includes order details and the process records. Lists 1 and 2 show
instances of XML file and a DTD, respectively.
In a shared XML tree, the tree structure is updated with actions such as inserting and deleting
subtrees. Allowing an arbitrary structure update might result in an invalid tree. Moreover, we
should assume that more than one update action is applied concurrently to the shared tree.
Therefore, in general, it is natural to design the shared tree such that update actions on the
shared structure can be applied to the repetitive parts. For the example in Figure 1,
adding/deleting an item to/from <order> and adding/deleting an order to/from <orders> are such
candidates. In an XML tree, we can identify repetitive parts based on a given DTD, with nodes
corresponding to symbols enclosed with * or +.
<orders>
<order>
<order-by>John</>
<status>preparation</>
<date>2001-08-01</>
<address>…</>
<item>
<title>Little Bear</>
<price>14.00</>
</>
<item>
<title>Blue Horse</>
<price>21.99</>
<discount>5</>
</item>
<bonus-item>
<code>BN-01</>
</>
<process-records>
<record>
<type>payment</>
<date>
2001-08-01</>
<status> OK</>
</>
<record>
<type>findstock</>
<date>
2001-08-02</>
<corr-p>E. Lee</>
</>
</process-records>
</order>
<order>
<status>shipped</>
<date>2001-08-13</>
<item>
<title>Mountain</>
<price>54.00</>
<copies>2</>
<discount>10</>
</>
<item>
<title>River</>
<price>46.50</>
<discount>10</>
</>
<process-records>
…
</process-records>
</order>
</orders>
TABLE 1: XML instance for orders.
4. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 129
<orders> := (<order>)*
<order> := <order-by>?<status><date><address>?(<item>|<bonus-item>)+<process-records>
<process-records> := (<record>)*(<cancel-log>|<close-date>|<return-log>)
<item> := <title><price><copies>?<discount>?
<record> := <type><date><corr-p>?<status>?
…
TABLE 2: DTD for orders instance in Table 1.
We found similar patterns from other examples in the literature, such as auction data and
shopping baskets. In an auction status list, adding a new bid to the bid list and deleting an auction
item from the list are applied to the repetitive parts. In a shared shopping basket, adding or
deleting a new item is the same action. As shown from these examples, shared actions that
update the tree structure are often applied to the repetitive parts of the tree.
orders
order order
ordered-by
status date item item
item item
title price
copies
“Mountain”
“River”
process-records
process-records
address
“Little Bear”
“Blue Horse”
status
date
bonus-item
FIGURE 1: An example of an XML tree
We found similar patterns from other examples in the literature, such as auction data and
shopping baskets. In an auction status list, adding a new bid to the bid -list and deleting an
auction item from the list are applied to the repetitive parts. In a shared shopping basket, adding
or /deleting a new item into basket is the same action. As shown from these examples, shared
actions that update the updating tree structure are often applied to the repetitive parts of the tree.
3.2 List Data Sharing Model
Actions for sharing XML data are 1) Read(w) or Write(w, valuenew) on a terminal node w, ; 2)
Traverse(v), to read a list of children of the internal node v, ; 3) Insert(v, Tnew, k), to insert a
subtree Tnew as k-th child of v, ; and 4) Delete(v, k), to delete the k-th subtree of v.
In general, concurrency control for of actions on terminal nodes like such as read/write data is
possible in a same way toa manner similar to that of traditional RDBs. Therefore, we focus on
the structure update actions such as subtree insertions and deletions. The main idea of this paper
is to simplify the sharing model by restricting structure update actions (Insert and Delete) only for
the repetitive parts of the tree. By doing so, the model can guarantee that the intermediate results
of the shared tree is are always valid. Also, we can get an efficient locking/concurrency
mechanism.
Restricting the insertion and /deletion for of repetitive parts might be a serious shortcoming in
some cases, since because it allows neither insertion / deletion of the optional part (? in DTD),
nor exchanges of the subtree structure defined by selections in DTD. However, designing those
ones as * or + parts in DTD is not difficult and sometimes helpful in our experience, since
5. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 130
because we can identify the shared parts of the tree in an earlier stage of development.
Moreover, this can help users to understand quite easily the meanings meaning of the data quite
easily andas well as their responsibility for collaborating on the data.
In the next section we will present a formal definition for the structure update actions for repetitive
parts of a shared tree.
4. CONCURRENCY CONTROL FOR LIST DATA SHARING MODEL
4.1 *-Facting of XML Trees
DTD defines types of XML trees, where in which the children of a node are represented with
sequential, optional (?), selective (|), and/or repetitive (* or +) parts2. Motivated by the facts fact
that the * parts are the main target for shared structure update actions, we introduce an XML tree
transformation called *-factoring before presenting our new locking protocol.
We call a the sequence of nodes X1X2...Xn a repeated part, if they correspond to children of * or +
nodes in a DTD graph. If the repeated part consists of one symbol X, then we call it a list node
(<order> or <item> nodes in Figure Fig. 1). If the subsequent list of nodes belong belongs to a
separate parent node, we call it a list parent node (<orders> and <process-records> in Figure Fig.
1). An XML tree is called *-factored if a group of nodes for each repetitive part consists of a
separate tree and there is a parent node for each repeated group. In a *-factored XML tree, every
repetitive part has one list node and sibling list nodes are that belong to a list parent node. The
example in Figure 1 is not *-factored since because the repeated parts of <item> and <bonus-
item> do not have a separate list parent node.
We can transform a given XML tree to a *-factored one by introducing new nodes. Algorithm 1
presents the transformation method. This algorithm repeats the factoring if i contains the
repetitive parts in the next cycle. Therefore, it factors the outmost outermost level of *’'s s at each
cycle. Algorithm 1 repeats O(n) times if the number of repetitive parts in the tree is n, and 2 two
new nodes are added in each transformation cycle.
Note that the *-factoring algorithm adds several new nodes to the tree. It is easy to recover the
original tree, by simply mapping new nodes to null. Hereafter, we will consider only *-factored
XML trees to simplify the discussion. Helmer et al. mentioned a similar approach to that added
add dummy nodes to group groups of repetitive parts to get better performance [7]. However,
they did not provide a formal model.
[Algorithm 1] *-Factoring
Input : a valid XML tree T with respect to the given DTD
Output : *-factored tree T’
1. Repeat the step 2 for every node w.
2. For all repetitive parts of the children of w, let (v11…v1m1)(v21…v2m2)…(vn1…vnmn) be a list
corresponding to * in DTD, where is repeated n times,
i) For 1 ≤ j ≤ n, if mj > 1, then add a node vj as a parent of vj1…vjmj in T.
ii) Add a node v as a parent of v1..vn, in T, which are added in step C, and as a child of w.
2 In our model, we use thea notation * instead of * or + for repetitive parts, if the context is clear. We can
assume that a delete action on the repetitive list is relevant only when there are is more than one children
child in the list for satisfying the + condition.
6. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 131
A
B EDDC C F
A
B
ED
DC C
F
B
H MKKJ H M
B
KK
JH H MM
A := B(C | DE?)*F B := (HJ?K*M)*
FIGURE 2: *-Factoring of Sample Subtrees.
Top, a production rule; middle, the corresponding tree instance; and bottom, the corresponding *-
factored tree for the one above one. The shadowed nodes are newly introduced list parent nodes
and the empty circles are new list nodes.
Now, we are ready to introduce the shared structure update actions used in our model.
[Definition 1] Let vL be a list parent node in a *-factored tree T. Then, list update actions on vL
are defined as follows.
ListInsert(vL, Tnew, k) : Insert Tnew as k-th child of vL.
ListDelete(vL, k) : Delete the k-th child subtree from vL. If vL is a (+)-list parent node, than this
action is relevant only if number-of-children(vL) > 1.
4.2 List Locking Protocol
In this paper, we propose a new locking protocol called a list locking protocol based on
MGL(Multiple Granularity Locking )[1] called a list locking protocol. Shared The shared actions on
an internal node are Traverse, ListInsert, and ListDelete, as defined in Definition 4.1. There are
four types of locks.:
- Traverse lock (T) : A lock request for traversing children or child list nodes.
- List lock (L) : A lock requested request to the list parent node for inserting or /deleting a
child tree. This will block other transaction transactions from accessing the same list.
- Delete lock (D) : A lock requested request to the root node of the deleted subtree for
deleting.
- Intentional lock (I) : A lock requested request for accessing descendent nodes.
Table 1 shows the compatibility of the list locking protocol. In the table, O shows represents
compatibility, X shows reflects conflict, and On means a case allowing write access with a
notification.
I T L D
I O O O X
T O O X X
L O On X X
D X X X X
TABLE 3: Comparability Relation of the List Locking Protocol.
7. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 132
We did not differentiate intentional locks for traverse and list update updates in the compatibility
relations. Note that, in this protocol, L lock is applied only for list parent nodes, and D lock is only
for list nodes. In the above table, On shows a possibility ofmay read reading invalidated data.
This can be prevented by using multi-version concurrency [2]. Structure update actions check in a
new version list index and traverse actions check out the last version. We simply assume that the
list update actions notify the clients, if necessary.
[Algorithm 2] List locking protocol:
[1] Locking phase
(1) To access any nodes in the tree, I(vroot) should be gained acquired first, where vroot is the
root node of the tree.
(2) To gain a lock T, L, or I on a node v, I(w) should be acquired gained first, where w is a
parent of v.
(3) To traverse the child nodes of v, T(v) should be acquired gained first.
(4) To delete a child tree of a node v, L(v) should be acquired gained first and D(vd), where
vd is the root of the deleted tree.,
(5) To insert a child tree to a node v, L(v) should be acquired gained first before inserting a
subtree.
[2] Release phase
(1) For a client to release a lock on v, the lock on all child nodes should be released first.
(2) If an update is allowed for a list parent node v with a dirty read, all clients with T(v) should
be informed of the a data update. should be notified to all clients acquiring T(v) before
releasing L(v).
(3)(2) For a shared action to get acquire another lock, it should release all of the locks it
is currently holding. One exception is to upgrade T(v) to L(v), which should be allowed in
order to update the list after visitingit is visited.
In the list locking protocol, intentional locks to all ancestor nodes first should be gained acquired
first in a top-down manner. ThereforeThereafter, it is enough sufficient to get a delete lock on the
subtree root node. Following The following two properties show that the list locking protocol
guarantees the serializability of list update actions.
[Property 1] In the list locking protocol, no more than one list update actions action are is
allowed to the same list parent node.
[Property 2] In the list locking protocol, a delete action is not allowed for any node whose
descendent is currently being accessed.
[Property 3] In the list locking protocol, two list update actions applied to different parent nodes
can be executed concurrently unless one of the corresponding list parent nodes is deleted by the
other action.
The list locking protocol considers structure traversal/update actions. In order toTo cover
read/write actions on terminal nodes, the previous MGL could be used togetherwith the list
locking protocol. If we model the data read/update as a node traversal, we could combine the
proposed protocol with the original MGL on the data values, without conflict.
8. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 133
5. DISCUSSION
5.1 Summary
We have proposed a locking scheme for XML documents that allows the same document to be
updated by more than one user. EspeciallyIn particular, we investigate investigated a
synchronization method of for structure updates on to shared trees, such as subtree insertion
insertions and deletiondeletions. The Our study on of XML sharing applications show showed that
subtree insertion/ and deletion is applied for to the repetitive parts of the tree. This motivates our
model, called awhich we call a list data data-sharing model, ; the model that restricts subtree
insertionsinsertion and /deletiondeletions on the repetitive parts of the tree based on DTDs. This
guarantees that the result tree valid even for concurrent structure update actions.
FIGURE 3: A Shared XML Data Interface Based on the Proposed Model.
Formally, we defined a *-factored XML tree and introduced a transformation method from
arbitrary XML trees to *-factored ones based on DTDs. By introducing *-factored trees, we could
simplify the concurrency control to handling handle a number of index lists. Also, locks on
repetitive parts of the tree are introduced; a traverse lock(T) and a list modification lock(L), which
consist of a list locking protocol based on MGL. The proposed locking protocol has the following
advantages compared to the previous methods.
First, the result tree trees that result after applying structure update actions are guaranteed to be
valid. Previous researches research did not consider the validity for of shared actions because of
the complexity of the problem. However, we think it is important that the intermediate result trees
are valid during XML data sharing. We introduced a relatively simple model for covering ensuring
XML trees’ validity.
Secondly, the locking protocol becomes efficient because we consider only the repetitive parts.
Number The number of locking objects is relatively small. Moreover, the new locking protocol
allows for updating other descendents while a child subtree is being deleted or /inserted.
5.2 Comparison
In this section, we compare the proposed method to several recent researches studies on XML
data locking.
A locking protocol called OO2PL [7,8], is a general model which that uses the physical links as
locking units. They say that theThe researchers argue that serializability should be the
foundation for protocols and that thea lowest level of atomic actions should be isolated in order to
prevent unwanted side effects. Therefore, OO2PL uses parent/child or sibling links as locking
units. Also, they canlinks can be locked lock on links by IDREFs or IDs for direct accessesaccess.
However, we believe that their this model is too general to be efficient for relatively simple XML
data. Since Because they use arbitrary pointers/links are used for locking units, the number of
locking objects should increase significantly. Also, two-phase locking they do notis used instead
use of multi-granularity, , but two phase locking instead. Therefore, they couldso it was not
9. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 134
possible to not take advantage of the native tree structure. They The researchers mentioned
using DTD information to enhance efficiency by restructuring links to group repetitive parts of the
children. HoweverAlthough, they describe a way to add dummy nodes to XML tree, no formal
method is but did not provide a formal methodprovided.
Another type of protocols protocol that is often used for hierarchical data are is the so-called tree
locking protocolsprotocol [10]. In these protocols, locks hold only for nodes do not hold forbut not
for entire granules but only for nodes, i.e., when a node is locked its descendants are not also
locked. However, there is also the restriction that a lock can only be acquired for a node if an
identical or stronger lock was already obtained for the parent of the node.
Path lock [5] is has been proposed to support arbitrary path expressions for accessing nodes in
XML trees. It can provide fine granule locks based on path locks. They give anAn algorithm is
provided to evaluate locks for a given path expression, and to check compatibility with the
previous locks. In this protocol, they can support path expressions such as //A//B can be
supported with a minimal number of locking objects. Instead, evaluatingEvaluating compatibility
with current locks is not easy. , however. Their The model does not support subtree deletion
since because they need to evaluate path conditions must be evaluated in either a top-down or
bottom-up waysmanner. We believe that deletingdeletions and /inserting insertions of subtrees
are important update actions for shared XML trees. Sometimes, the sharing is more for editing
and /managing XML trees rather than for searching and /querying. In that case, our protocol could
be useful to serialize structure update actions including subtree deletions.
The main restriction of our study is not that it does not consider navigations through considering
ID- and IDREF-based accesses. This is because our approach is focused on the (repeat)
structure of the tree definition and updates on to the structure. We treat IDREFS as terminal
nodes which can be inserted and/or deleted.
6. REFERENCES
[1] N. S. Barghouti, G. E. Kaiser., “Concurrency control in advanced database applications,”.
AACM Computing Surveys, vol.23(3), pp.269-317, 1991.
[2] P. Bernstein, N. Goodman., “Multiversion concurrency control – theory and algorithms,”.
ACM TransTransactions. On on Database Systems, vol. 8(4), pp.465-483, 1983.
[3] B. Bouchou, and M. Halfeld and, F. Alves., “"Updates and Incremental Validation of XML
Documents,". The 9th International Workshop on Data Base Programming Languages
(DBPL), 2003, pp.216-232.
[4] Stijn S. Dekeyser, Jan J. Hidders., “Path locks for XML Document collaboration,”. Proc.
WISE'02, 2002, pp.105-114.
[5] Torsten T. Grabs, Klemens K. Bohm and, HansH.-Jorg J. Schek., “"XMLTM: Efficient
Transaction Management for XML Documents,"”. CKIM’02, 2002, pp.142-152.
[6] S. Helmer, C. Kanne and, G. Moerkotte, “"Lock-based Protocols for Cooperation on XML
Documents”.," Int.International Workshop on DB and Expert Systems Applications
Conference (DEXA'03), 2003, pp.230-236.
[7] S. Helmer, C. Kanne and, G. Moerkotte, . “"Evaluating lock-based protocols for coorperation
cooperation on XML documents”.," ACM SIGMOD Record, vol. 33(1), 2004, pp.58- – 63.
[8] KuenK.-Fang F. Jea, ShihS.-Ying Y. Chen and ShengS.-H.Hsien Wang., “Concurrency
Control in XML Document Databases: XPath Locking Protocol,”. In: Proceedings of the 9th
10. Eunjung Lee
International Journal Data Engineering (IJDE), Volume (2) : Issue (3) : 2011 135
International Conference on Parallel a6d and Distributed Systems (ICPADS 2002), 2002,
pp.551-556.
[9] V. Lanin and D. Shasha., “Tree locking on changing trees,”. Technical Report 503, New
York University, 1986.
[10] S.-Y. Lee and R.-L. Liou. “A multi-granularity locking model for concurrency control in
object-oriented database systems,”. IEEE Trans.Transactions onOn Knowledge and Data
Engineering, vol. 8(1), 1996, pp.144- -- 156.
[11] World wide web consortium, “XForms 1.0 Working draft,” http://www. w3. org/TR/xforms,
Jan. 2002, [Jan. 28. 2002].
[12] E. Harder, C. Mathis, S. Bachle, K. Schmidt and, A. Weiner., “Essential performance drivers
in native XML DBMSs,”. LNCS 5901, 2010, pp. 29-46.
[13] S. Bachle, T. Harder and, M. Haustein., “Implementing and optimizing fine-granular lock
management for XML document Trees,”. DASFAA’09, 2009, pp.631-635.
[14] M.Haustein, T.Harder, “Optimizing lock protocols for native XML processing,” Data &
Knowledge Engineering, vol.65(1), 2008, pp.147-173.
[15] H. Tan, X. Chen and, J. Gu, . “A transaction mechanism for native XML database,”.
Proceedings of the 5th WSEAS International Conference on Applied Computer Science,
2006, pp. 486-490.
[16] P.Pleshachkov, P.Chardin, S.Kusenetzov, “SXDGL: Snapshot based concurrency protocol
for XML data,” XSym 2007, LNCS 4704, 2007, pp.122-136.