Browsing NTNU Open by Author "Chester, Sean"

Now showing items 1-6 of 6

    • Diversifying Top-k Point-of-Interest Queries via Collective Social Reach 

      Maropaki, Stella; Chester, Sean; Doulkeridis, Christos; Nørvåg, Kjetil (Chapter, 2020)
      By "checking into'' various points-of-interest (POIs), users create a rich source of location-based social network data that can be used in expressive spatio-social queries. This paper studies the use of popularity as a ...

    • Efficient Spatial Search using Memory Resident R-trees 

      Fossum, Truls Rustad (Master thesis, 2017)
      This thesis investigates the performance of memory resident spatial search, focusing on the R-tree. The characteristics of modern computer architectures are first visited to understand how they have changed since the ...

    • Efficient top-k recently-frequent term querying over spatio-temporal textual streams 

      Dam, Thu-Lan; Chester, Sean; Nørvåg, Kjetil; Duong, Quang-Huy (Peer reviewed; Journal article, 2021)
      Massive amounts of data with spatio-temporal-textual information are being generated due to the proliferation of GPS-equipped mobile devices. Much of this data are social media posts, often used to share and spread personal ...

    • Improving Spatial Data Processing by Clipping Minimum Bounding Boxes 

      Sidlauskas, Darius; Chester, Sean; Zacharatou, Eleni Tzirita; Ailamaki, Anastasia (Chapter, 2018)
      The majority of spatial processing techniques rely heavily on the idea of approximating each group of spatial objects by their minimum bounding box (MBB). As each MBB is compact to store (requiring only two multi-dimensional ...

    • Template Skycube Algorithms for Heterogeneous Parallelism on Multicore and GPU Architectures 

      Bøgh, Kenneth Sejdenfaden; Chester, Sean; Sidlauslas, Darius; Assent, Ira (Chapter, 2017)
      Multicore CPUs and cheap co-processors such as GPUs create opportunities for vastly accelerating database queries. However, given the differences in their threading models, expected granularities of parallelism, and memory ...

    • Triad Enumeration at Trillion-Scale Using a Single Commodity Machine 

      Santoso, Yudi; Thomo, Alex; Srinivasan, Venkatesh; Chester, Sean (Chapter, 2019)
      Triad enumeration yields more detailed information than triangle enumeration. However, triad enumeration is more complex as it has to list the edges as well as the nodes of the triads. Furthermore, it is challenging to do ...