Querying Spatiotemporal Data Based on XML Twig Pattern

نویسندگان

  • Luyi Bai
  • Yin Li
  • Jiemin Liu
چکیده

With the increasing applications based on location, researches on spatiotemporal data, especially queries of spatiotemporal data have attracted a lot of attention. XML, as a standard language of information exchanging over the Web, has the ability to query spatiotemporal data. In this paper, we propose an algorithm, TwigStackSP, for matching a spatiotemporal XML query twig pattern. We represent spatiotemporal data by adding spatial and temporal attributes in general data and extend region coding scheme to filter the nodes in P-C relationship. Our technique uses a chain of linked stacks to compactly represent partial results to root-to-leaf query paths, which are then composed to obtain matches for the twig pattern. It can be proved that TwigStackSP is I/O and CPU optimal when there are no text nodes in P-C relationship of twig pattern.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive Twig Pattern Query

XQuery is a language for querying XML data which is widely used on the Internet. In XQuery, user can define recursive functions for querying and processing XML data. XML twig pattern query is considered as core operation for querying XML data which has been studied intensively in recent years. More powerful recursive queries can be achieved via combining user-defined recursive function and twig...

متن کامل

Fast Leaf-to-Root Holistic Twig Query on XML Spatiotemporal Data

With the increasing applications based on location, the researches on spatiotemporal data, especially queries of spatiotemporal data have attracted a lot of attention. XML, as a standard language of information exchanging over the Web, should have the ability to query spatiotemporal data. In this paper, we propose an algorithm, TwigSPFast, for matching a spatiotemporal XML query twig pattern. W...

متن کامل

TwigStackList-: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data

As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match XML twig queries. However, as far as we know, very little work has examined the efficient processing of XML twig queries with not-predicates. In this paper, we propose a novel holistic twig join algorithm, called Twig...

متن کامل

A Parallel Twig Join Algorithm for XML Processing using a GPGPU

With an increasing amount of data and demand for fast query processing, the efficiency of database operations continues to be a challenging task. A common approach is to leverage parallel hardware platforms. With the introduction of general-purpose GPU (Graphics Processing Unit) computing, massively parallel hardware has become available within commodity hardware. XML is based on a tree-structu...

متن کامل

Efficient Querying and Updating of XML Data The Rainforest Data Structure

With the advent of the World Wide Web and the increase in information sharing it has brought, information interchange formats based on XML have become more and more important, and the need has arisen to store and process semistructured data. Prior work has mainly focused on developing XML extensions for relational database systems, with a focus on querying. This research takes a different tack,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2016