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 259 for “"Efficient Processing"”.

  1. Efficient processing of XML documents

    In this thesis, we advocate storing XML documents in a relational DBMS, and address the related challenges. In particular, we set out to address the issues of mapping, indexing and updating XML documents.

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

  2. Efficient processing of hierarchical graphs

    <p>The standard representation of a graph is a list of its vertices and edges. However, graphs encountered in some areas have structural regularities that allow them to be represented using considerably less space. Typically, such a succinct encoding consists of a list of basic parts and a set of …

    iastate Repository record for Efficient processing of hierarchical graphs (opens in a new tab)

  3. Efficient processing of XML messages

    … the language. Second, we look at the problem of processing streaming XML data efficiently against a large number of branch XPath queries. To address query performance issues, we propose a technique that evaluates groups of similar branch queries simultaneously. Moreover, while join operations are …

    unsw Repository record for Efficient processing of XML messages (opens in a new tab)

  4. Efficient Processing of Geo-tagged Data

    … Consequently, there is an emerging call for efficient data analysis and processing techniques to make sense of these geo-tagged data. Specially, this thesis studies four important problems regarding to three types of geo-tagged data, i.e., spatio-textual object, geo-social network and object …

    unsw Repository record for Efficient Processing of Geo-tagged Data (opens in a new tab)

  5. Efficient Processing of Spatial Keyword Queries

    … importance, a large body of work has focused on efficiently computing various spatial keyword queries. In this thesis, we investigate three important problems on spatial keyword search: 1) Top-k Boolean spatial keyword query, 2) Diversified spatial keyword search query on road network, and 3) …

    unsw Repository record for Efficient Processing of Spatial Keyword Queries (opens in a new tab)

  6. Efficient processing of proximity based spatial queries

    … importance, a large body of work has focused on efficiently computing various spatial queries. A proximity based spatial query computes the results based on the proximity (closeness) between the objects. Range queries, reverse k nearest neighbors (RkNN) queries and k-closest pairs queries are …

    unsw Repository record for Efficient processing of proximity based spatial queries (opens in a new tab)

  7. Efficient processing of XML twig pattern matching

    … and presented in XML format. The ability to efficiently query XML data sources, therefore, becomes increasingly important. This thesis studies the query processing of a core subset of XML query languages: XML twig queries. An XML twig query, represented as a small query tree, is essentially a …

    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)

  8. Efficient processing of multiple XML twig queries

    … 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 …

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

  9. Efficient processing of KNN and skyjoin queries

    … vectors into bit-strings. We also developed an efficient KNN search algorithm using MinMax Pruning or Partial MinDist Pruning method. Besides high-dimensional KNN query, we also extend the skyline operation to the Skyjoin query, which finds the skyline of each data point in the database. We …

    nus Repository record for Efficient processing of KNN and skyjoin queries (opens in a new tab) Download file for Efficient processing of KNN and skyjoin queries (opens in a new tab)

  10. Efficient Processing and Reasoning of Semantic Streams

    … thesis studies how to improve the efficiency of processing and reasoning over semantic streams. It is composed of three projects that deal with different research problems motivated by real-world use cases. We propose new methods to address these problems and implement systems to test our …

    zurich

  11. Efficient processing and representations for 3D tasks

    <p>The challenge this thesis aims to address is that of improving the efficiency of deep learning on 3D tasks. We consider this problem from two angles. First how we can improve the efficiency of operations on dense voxel grids. Then second how recent improvements in representational efficiency can …

    oxford Repository record for Efficient processing and representations for 3D tasks (opens in a new tab)

  12. Efficient processing of similarity queries with applications

    … applications, call for identifying and processing similarities in "big" data. As a result, it is imperative to develop new similarity query processing approaches and systems that scale from low dimensional data to high dimensional data, from single machine to clusters of hundreds of …

    purdue-thes Repository record for Efficient processing of similarity queries with applications (opens in a new tab)

  13. Towards Efficient Processing of Big Spatial Data

    … in which huge amounts of spatial data need to be efficiently processed. To cope with such proliferation of spatial data, this dissertation addresses two key issues that are overlooked by existing spatial-query processing platforms: i) the multiplicity of predicates in spatial queries, and ii) the …

    purdue-thes Repository record for Towards Efficient Processing of Big Spatial Data (opens in a new tab)

  14. Neuromorphic vision Sensors with Foveation for efficient Processing

    This dissertation addresses the challenge of improving the efficiency and adaptability of high-resolution event-based vision sensors for real-time applications. While dynamic vision sensors (DVS) offer significant advantages over frame-based vision sensors, increasing spatial resolution leads to a …

    sevilla Repository record for Neuromorphic vision Sensors with Foveation for efficient Processing (opens in a new tab)

  15. Energy efficient processing in opportunistic vehicular edge clouds

    … revolution in term of their on-board units and processing capabilities producing a new promising framework concept. This concept is a consequence of the integration of vehicles and cloud computing, referred to as Vehicular Edge Cloud (VEC). This thesis investigates distributed processing in …

    whiterose Download PDF for Energy efficient processing in opportunistic vehicular edge clouds (opens in a new tab)

  16. Efficient processing of spatial queries over uncertain database

    … in the context of uncertain data models. Efficient algorithms are strongly demanded to analyze spatial uncertain data. This thesis studies four fundamental problems to analyze spatial uncertain data by proposing efficient query processing algorithms, including (1) find top k influential …

    unsw Repository record for Efficient processing of spatial queries over uncertain database (opens in a new tab)

  17. Efficient processing of XML path queries with not-predicates

    … QUERIES FORMS THE BASIS OF COMPLEX XML QUERY PROCESSING WHICH HAS ATTRACTED A LOT OF RESEARCH ATTENTION. HOWEVER, NONE OF THESE WORKS HAVE EXAMINED THE PROCESSING OF MORE COMPLEX QUERIES THAT CONTAIN NOT-PREDICATES. IN THIS PAPER, WE PRESENT THE FIRST STUDY ON EVALUATING PATH QUERIES WITH …

    nus Repository record for Efficient processing of XML path queries with not-predicates (opens in a new tab) Download file for Efficient processing of XML path queries with not-predicates (opens in a new tab)

  18. Efficient Processing and Storage for Massive MIMO Digital Baseband

    … However, massive MIMO requires simultaneous processing of signals for all the antenna chains and real-time computations involving large-size matrices. Compared to today’s small-scale MIMO, the corresponding computational complexity can be orders of magnitude higher, which inevitability leads …

    lund Repository record for Efficient Processing and Storage for Massive MIMO Digital Baseband (opens in a new tab) Download PDF for Efficient Processing and Storage for Massive MIMO Digital Baseband (opens in a new tab)

Page 1 of 13