Browsing by Subject "Query processing"

Now showing items 1-15 of 15

    • Article  

      Broadcast scheduling with multiple concurrent costs 

      Liaskos, Christos K.; Xeros, Andreas; Papadimitriou, Georgios I.; Lestas, Marios; Pitsillides, Andreas (2012)
      Data dissemination via periodic broadcasting considers a set of items, each with a given request probability, size and scheduling cost. The goal is to construct a broadcast schedule that minimizes the mean query serving ...
    • Article  

      Crowdsourcing emergency data in non-operational cellular networks 

      Chatzimilioudis, Georgios; Costa, Constantinos; Zeinalipour-Yazdi, Constantinos D.; Lee, W. -C (2017)
      In overloaded or partially broken (i.e., non-operational) cellular networks, it is imperative to enable communication within the crowd to allow the management of emergency and crisis situations. To this end, a variety of ...
    • Conference Object  

      A data mashup language for the Data Web 

      Jarrar, M.; Dikaiakos, Marios D. (2009)
      This paper is motivated by the massively increasing structured data on the Web (Data Web), and the need for novel methods to exploit these data to their full potential. Building on the remarkable success of Web 2.0 mashups, ...
    • Conference Object  

      Distributed spatio-temporal similarity search 

      Zeinalipour-Yazdi, Constantinos D.; Lin, S.; Gunopulos, Dimitrios (2006)
      In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to Q, when each of the target trajectories is ...
    • Article  

      Dynamic adaptive data structures for monitoring data streams 

      Aguilar-Saborit, J.; Trancoso, Pedro; Muntes-Mulero, V.; Larriba-Pey, J. L. (2008)
      The monitoring of data streams is a very important issue in many different areas. Aspects such as accuracy, the speed of response, the use of memory and the adaptability to the changing nature of data may vary in importance ...
    • Conference Object  

      Exploring database workloads on future clustered many-core architectures 

      Petrides, P.; Diavastos, Andreas; Trancoso, Pedro (2011)
      Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that process large data sets. Traditionally, DSS queries have been accelerated using large-scale multiprocessor. In ...
    • Article  

      Finding the K highest-ranked answers in a distributed network 

      Zeinalipour-Yazdi, Constantinos D.; Vagena, Zografoula; Kalogeraki, Vana; Gunopulos, Dimitrios; Tsotras, Vassilis J.; Vlachos, Michail; Koudas, Nick; Srivastava, D. (2009)
      In this paper, we present an algorithm for finding the k highest-ranked (or Top-k) answers in a distributed network. A Top-K query returns the subset of most relevant answers, in place of all answers, for two reasons: (i) ...
    • Article  

      In-memory parallelism for database workloads 

      Trancoso, Pedro (2002)
      In this work we analyze the parallelization of database workloads for an emerging memory technology: Processing-In-Memory (PIM) chips. While most previous studies have used scientific workloads to evaluate PIM architectures, ...
    • Conference Object  

      KSpot: Effectively monitoring the k most important events in a wireless sensor network 

      Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Vassiliadou, M.; Chrysanthis, Panos K.; Samaras, George S. (2009)
      This demo presents a graphical user interface and ranking system, coined KSpot, for effectively monitoring the K highest-ranked answers to a query Q in a Wireless Sensor Network. KSpot deploys state-of-the-art distributed ...
    • Article  

      Optimized query routing trees for wireless sensor networks 

      Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Pamboris, Andreas; Chrysanthis, Panos K.; Samaras, George S. (2011)
      In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...
    • Article  

      Power efficiency through tuple ranking in wireless sensor network monitoring 

      Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Chrysanthis, Panos K.; Samaras, George S. (2011)
      In this paper, we present an innovative framework for efficiently monitoring Wireless Sensor Networks (WSNs). Our framework, coined KSpot, utilizes a novel top-k query processing algorithm we developed, in conjunction with ...
    • Conference Object  

      Scalability and efficiency of database queries on future many-core systems 

      Petrides, P.; Diavastos, Andreas; Christofi, Constantinos; Trancoso, Pedro (2013)
      Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that process large data sets. Traditionally, DSS queries have been accelerated using large-scale multiprocessors. ...
    • Conference Object  

      SenseSwarm: A perimeter-based data acquisition framework for mobile sensor networks 

      Zeinalipour-Yazdi, Constantinos D.; Andreou, Panayiotis G.; Chrysanthis, Panos K.; Samaras, George S. (2007)
      This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting and aggregating spatio-temporal events of interest and to store ...
    • Conference Object  

      SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces 

      Costa, Constantinos; Laoudias, Christos; Zeinalipour-Yazdi, Constantinos D.; Gunopulos, Dimitrios (2011)
      In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participating users. Our framework, exploits opportunistic ...
    • Conference Object  

      The threshold join algorithm for top-k queries in distributed sensor networks 

      Zeinalipour-Yazdi, Constantinos D.; Vagena, Zografoula; Gunopulos, Dimitrios; Kalogeraki, Vana; Tsotras, Vassilis J.; Vlachos, Michail; Koudas, Nick; Srivastava, D. (2005)
      In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query is to find the k highest ranked answers ...