Algorithmic Design Using Object-Z for Twig XML Queries Evaluation
نویسندگان
چکیده
Web technologies based on XML, e.g. Semantic Web and Web Services, facilitate Web automation and universally accessible content. One of the key factors for the success of XML-based technologies is of finding an efficient query evaluation algorithm for XMLbased data models. An XML twig query is a complex selection predicate on both structure and content of a labelled XML document. Several novel twig query evaluation algorithms have been proposed recently. However, these algorithms are difficult to understand and hence implement due to high complexity. In this work, we present an algorithmic design for XML queries evaluation system using Object-Z. An Object-Z specification is developed to give a concise and logical description of the XML data model and the twig queries. It makes the twig query evaluation straight-forward, and allows different evaluation algorithms to be constructed easily and independently.
منابع مشابه
Evaluation of Twig Pattern Queries for Streaming Xml Data Using Lineage Encoding
In this paper, we propose an energy and latency efficient XML dissemination scheme for the mobile computing. It describes a novel unit structure called G-node for streaming XML data in the wireless environment. It exploits the profit of the structure indexing and attributes summarization that may integrate relevant XML elements into a group. It provides a way for choosy access of their attribut...
متن کاملAnswering XML Twig Queries with Automata
XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size...
متن کاملEfficient Processing of Ordered XML Twig Pattern
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results. The existing holistic join algorithms, however, cannot deal with ordered twig queries. A straightforward approach that first match...
متن کاملFast Evaluation of Multi-source Star Twig Queries in a Path Materialization-based XML Database
Despite a large body of work on xml twig query processing in relational environment, systematic study of xml join evaluation has received little attention in the literature. In this paper, we propose a novel and non-traditional technique for fast evaluation of multi-source star twig queries in a path materialization-based rdbms. A multi-source star twig joins different xml documents on values i...
متن کاملEfficient Processing of Multiple XML Twig Queries
Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data interchange has spawned great interest in techniques for filtering and content-based routing of XML data. In this paper, we aim to use the state-of-art holistic twig join technique to address multiple twig queries in a large scale ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 151 شماره
صفحات -
تاریخ انتشار 2006