Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Tree pattern"”.

  1. On the study of tree pattern matching algorithms and applications

    Solving Tree Pattern Query problem is the central part of XML database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, …

    ubc Repository record for On the study of tree pattern matching algorithms and applications (opens in a new tab) Download PDF for On the study of tree pattern matching algorithms and applications (opens in a new tab)

  2. Processing techniques for partial tree-pattern queries on XML data

    … data on the Web. XML structures data as trees. Querying capabilities are provided through patterns matched against the XML trees. Research on the processing of XML queries has focused mainly on tree-pattern queries. Tree-pattern queries are not appropriate for querying XML data sources …

    njit Repository record for Processing techniques for partial tree-pattern queries on XML data (opens in a new tab)

  3. Semantics and efficient evaluation of partial tree-pattern queries on XML

    … a query language for XML called Partial Tree-Pattern Query (PTPQ) language is considered. PTPQs generalize and strictly contain Tree-Pattern Queries (TPQs) and can express a broad structural fragment of XPath. Because of their expressive power and flexibility, they are useful for querying …

    njit Repository record for Semantics and efficient evaluation of partial tree-pattern queries on XML (opens in a new tab)

  4. Using tree patterns for flexible handling of XML keys : submitted in partial fulfillment of the requirements for the degree of Master of Science at Massey University, Palmerston North, New Zealand

    … are path expression PƐ, XPath expression XƐ and tree pattern TP. We focus on a special tree pattern TP called safe tree pattern, denoted by SP, which has been proved to be equivalent to XML keys where Q are in XƐǀ,ǁ, Q¹ are in XPǀ,ǁ and Pₗ,..., Pₖ are in XƐǀ,*. We propose a set of inference rules …

    massey Repository record for Using tree patterns for flexible handling of XML keys : submitted in partial fulfillment of the requirements for the degree of Master of Science at Massey University, Palmerston North, New Zealand (opens in a new tab)

  5. From tree patterns to generalized tree patterns : on efficient evaluation of XQuery

    … for efficient query evaluation, and the Tree Algebra for XML (TAX), among others, is invented for this purpose. It can be shown in this thesis that a substantial subset of XQuery can be expressed as TAX. An XML document is often modelled as an ordered label tree. A core operation in the …

    ubc Repository record for From tree patterns to generalized tree patterns : on efficient evaluation of XQuery (opens in a new tab) Download PDF for From tree patterns to generalized tree patterns : on efficient evaluation of XQuery (opens in a new tab)

  6. Supporting library interface changes in open system software evolution

    … approach and a tool set based on concrete syntax tree pattern matching intended to reduce these costs. Specifically, in our approach, a library maintainer annotates changed functions with rules that are used to generate tools that will update the applications that use the updated libraries. Thus, …

    washington Repository record for Supporting library interface changes in open system software evolution (opens in a new tab)

  7. Theoretical prediction of joint reaction force in a dynamic general 3-d pendulum tree model for human or animal motion

    … flexible model of a branched 3-D pendulum tree system. The number of segments and joints on the tree are adjustable as is the branching tree pattern. The segments that comprise the tree are assumed to be one- dimensional rigid rods containing a discrete set of mass points that is both …

    njit Repository record for Theoretical prediction of joint reaction force in a dynamic general 3-d pendulum tree model for human or animal motion (opens in a new tab)

  8. XML Query optimization

    … to a large fragment of XML queries known as tree pattern queries (TPQs). It focuses on two important optimization aspects: query minimization and query answering using views. For query minimization, prior work has focused on minimizing TPQs corresponding to the XPath semantics, with or …

    nus Repository record for XML Query optimization (opens in a new tab) Download file for XML Query optimization (opens in a new tab)

  9. A data science approach to pattern discovery in complex structures with applications in bioinformatics

    Pattern discovery aims to find interesting, non-trivial, implicit, previously unknown and potentially useful patterns in data. This dissertation presents a data science approach for discovering patterns or motifs from complex structures, particularly complex RNA structures. RNA secondary and …

    njit Repository record for A data science approach to pattern discovery in complex structures with applications in bioinformatics (opens in a new tab)

  10. Using materialized views for answering graph pattern queries

    <p>Discovering patterns in graphs by evaluating graph pattern queries involving direct (edge-to-edge mapping) and reachability (edge-to-path mapping) relationships under homomorphisms on data graphs has been extensively studied. Previous studies have aimed to reduce the evaluation time of graph …

    njit Repository record for Using materialized views for answering graph pattern queries (opens in a new tab)

  11. Efficient peer-to-peer data management

    … to specify views over these documents using a tree pattern language. Whenever a user asks a query, the system will try to find views that can be combined in order to find a rewriting equivalent to the asked query. We have carried WAN experiments that show the scalability of the ViP2P platform.

    greece Repository record for Efficient peer-to-peer data management (opens in a new tab)

  12. A system for large-scale image and video retrieval on everyday scenes

    … probable captions, parsed and represented by tree structures using NLP techniques, and detected objects. The PIU's are stored and indexed in a database system. For a query image, the Query Processor generates the most probable caption and parses it into the corresponding tree structure. Then …

    missouri Repository record for A system for large-scale image and video retrieval on everyday scenes (opens in a new tab)

  13. Child Prime Label Approaches to Evaluate XML Structured Queries

    … data efficiently. Due to the importance of twig pattern matching in XML retrieval systems, finding all matching occurrences of a tree pattern query in an XML document is often considered as a specific task for XML databases as well as a core operation in XML query processing. This thesis presents …

    whiterose Download PDF for Child Prime Label Approaches to Evaluate XML Structured Queries (opens in a new tab)

  14. The role of spatial pattern in controlling forest dynamics

    … collective attributes such as average tree size and density. Spatially explicit mapping and modeling of trees allow forests to be seen as compositions of individuals, with unique spatial arrangements and patterns. Analysis of these patterns provides insight into the interactions between …

    colostate Repository record for The role of spatial pattern in controlling forest dynamics (opens in a new tab)

  15. Extending data mining techniques for frequent pattern discovery: Trees, low-entropy sets, and crossmining

    The idea of frequent pattern discovery is to find frequently occurring events in large databases. Such data mining techniques can be useful in various domains. For instance, in recommendation and e-commerce systems frequently occurring product purchase combinations are essential in user preference …

    aalto Repository record for Extending data mining techniques for frequent pattern discovery: Trees, low-entropy sets, and crossmining (opens in a new tab)

  16. Efficient processing of XML twig pattern matching

    … An XML twig query, represented as a small query tree, is essentially a complex selection on the structure of an XML document. Matching a twig query means finding all the instances of the query tree embedded in the XML data tree. We present in this thesis a series of new holistic twig join …

    nus Repository record for Efficient processing of XML twig pattern matching (opens in a new tab) Download file for Efficient processing of XML twig pattern matching (opens in a new tab)

  17. ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΤΩΝ ΣΥΝΑΡΤΗΣΕΩΝ ΔΕΝΔΡΟΥ

    … ΔΙΝΟΝΤΑΙ ΕΦΑΡΜΟΓΕΣ ΤΟΥ ΘΕΩΡΗΜΑΤΟΣ TURAKAINEN ΣΤΟ PATTERN MATCHING ΓΙΑ ΔΕΝΔΡΑ ΟΠΩΣ ΚΑΙ ΣΤΗΘΕΩΡΙΑ ΤΩΝ ΑΡΙΘΜΗΤΙΚΩΝ ΕΚΦΡΑΣΕΩΝ.

    greece Repository record for ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΤΩΝ ΣΥΝΑΡΤΗΣΕΩΝ ΔΕΝΔΡΟΥ (opens in a new tab)

  18. Generická analýza toků v počítačových sítích

    Tato práce se zabývá problematikou popisu síťového provozu pomocí automaticky vytvořeného modelu komunikace. Hlavním zaměřením jsou komunikace v řídicích systémech , které využívají speciální protokoly, jako je například IEC 60870-5-104 . V této práci představujeme metodu charakteristiky síťového …

    brno-tech Repository record for Generická analýza toků v počítačových sítích (opens in a new tab)

  19. Single tree detection and modeling using airborne laser scanner data

    The increasing demand for single tree based information, as a basis to improve forest management practices, is the motivation behind the development of single tree detection and modeling techniques that processes airborne laser scanning (ALS) data. Most tree detection algorithms are raster based …

    freiburg-diss Repository record for Single tree detection and modeling using airborne laser scanner data (opens in a new tab)