The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Aiming at the problem of failing to support effective structural join on compressed data of existing XML Data compressors, this paper proposes a new Compressor Structural Join Oriented XML Data Compressor which makes structural join possible by giving all elements and attribute names in document a unique region encoding. This paper also provides a definition of the Same Sub Tree(SST) and an algorithm...
Finding all the occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. Since every complex twig query consists of linear ones, it is important to handle linear twig queries effectively. In this paper, we propose a novel path-partitioned encoding scheme, and find a holistic solution to match linear twig queries with no structural join. We show that...
With the problem that the cost is too much for temporary sorting or creating index aimed for there is no index or the index is out-of-order of input data sets in most XML structural join methods, the classical Stack-Tree-Desc algorithm and B+ tree index optimization algorithm are analyzed. A new strategy that isnpsilat limited to any external index is proposed and implemented. The experiment results...
As the huge amount of XML data emerging in Web, researchers begin to focus on the topic of querying against XML data efficiently. Different from the query processing in relational data, XML query is characterized by structural join. Hence, quickly evaluating the cost of the join operation with the size of the intermediate results is an important part of XML query plan generation .In this paper, an...
The leap from single-core to multi-core has permanently altered the course of computing, enabling increased productivity, powerful energy-efficient performance, and leading-edge advanced computing experiences. Although traditional single-thread XPath query evaluation algorithms can run properly on multi-core CPUs, they cannot take full use of the computing resources of multi-core CPUs. To take advantage...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.