Filters








111,029 Hits in 4.2 sec

Continuous Processing of Preference Queries in Data Streams [chapter]

Maria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos
2010 Lecture Notes in Computer Science  
In this paper, we examine the characteristics of important preference queries, such as skyline, top-k and top-k dominating and we review algorithms proposed for the evaluation of continuous preference  ...  The goal of continuous query processing is to continuously evaluate longrunning queries by using incremental algorithms and thus to avoid query evaluation from scratch, if possible.  ...  In [26] , the authors studied efficient algorithms for top-k dominating query processing in uncertain databases.  ... 
doi:10.1007/978-3-642-11266-9_4 fatcat:wbfgvvzlqjcsjfl3ondsaeuj7q

Preference-based top-k spatial keyword queries

Jinzeng Zhang, Dongqi Liu, Xiaofeng Meng
2011 Proceedings of the 1st international workshop on Mobile location-based service - MLBS '11  
One reason for those queries contain fuzzy linguistic labels that often embody users' preference, e.g., finding hotels near Zhongguancun with moderate price.  ...  Given a query with fuzzy labels, we propose an efficient strategy of computing users' preference to transform these labels into the [0,1] interval, and design two effective search methods to find relevant  ...  However, the current works cannot give an efficient support for PTkSK queries.  ... 
doi:10.1145/2025876.2025883 fatcat:ozsak2ggvbgezg365whkltg7wi

Malleability-Aware Skyline Computation on Linked Open Data [chapter]

Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Balke
2012 Lecture Notes in Computer Science  
In recent years, the skyline query paradigm has been established as a reliable and efficient method for database query personalization.  ...  and establish its theoretical properties c) we develop innovative skyline algorithms to deal with the resulting challenges and extensively evaluate the our new algorithms with respect to performance and  ...  for approximate query processing algorithms.  ... 
doi:10.1007/978-3-642-29035-0_3 fatcat:tw6lvmwv3zdg7drlzn6wxojfra

Goal Directed Relative Skyline Queries in Time Dependent Road Networks [article]

K. B. Priya Iyer, V. Shanthi
2012 arXiv   pre-print
The experimental evaluation reflects the performance of GD-RST algorithm over the traditional branch and bound algorithm for skyline queries in real road networks.  ...  We design an efficient algorithm based on Filter phase, Heap phase and Refine Skyline phases.  ...  Here total execution time of all query phases except pre-computation is taken for GD-RST and BBS algorithm is distance based skyline query processing.  ... 
arXiv:1205.1853v1 fatcat:4iwkvhqanreffinhvhv7zufdyq

Goal Directed Relative Skyline Queries in Time Dependent Road Networks

K.B. Priya Iyer
2012 International Journal of Database Management Systems  
The experimental evaluation reflects the performance of GD-RST algorithm over the traditional branch and bound algorithm for skyline queries in real road networks.  ...  We design an efficient algorithm based on Filter phase, Heap phase and Refine Skyline phases.  ...  Here total execution time of all query phases except pre-computation is taken for GD-RST and BBS algorithm is distance based skyline query processing.  ... 
doi:10.5121/ijdms.2012.4202 fatcat:a6772cxtc5cjxjdfmdirnitruu

Efficient influence-based processing of market research queries

Anastasios Arvanitis, Antonios Deligiannakis, Yannis Vassiliou
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
In this work we develop novel algorithms for efficiently processing two important classes of queries involving user preferences, i.e. potential customers identification and product positioning.  ...  Our experimental study using both real and synthetic data sets demonstrates the superiority of our proposed algorithms for the studied classes of queries.  ...  Dimitris Papadias for his support during the early stages of this research work.  ... 
doi:10.1145/2396761.2398420 dblp:conf/cikm/ArvanitisDV12 fatcat:4xjfl4dpxbej3aua2tyxs4ni2e

Applicability of skyline query algorithm for career identification of k-12 graduates Primary tabs

Custodio Eunice Bondoc, Tumibay Gilbert Malawit
2020 Global Journal of Engineering and Technology Advances  
Different skyline query algorithm and processing were presented.  ...  Computing user preference using skyline query algorithm can be a tool in determining the right career intended for a student since it can be used for various applications that include decision making,  ...  Acknowledgments The authors would like to express their gratitude and thanks to Angeles University Foundation and to Bulacan State University Administration for all the kind support and help.  ... 
doi:10.30574/gjeta.2020.2.3.0012 fatcat:7x6qmemjebcvxiuqzuxucjknrq

Efficient Processing of Top-k Spatial Preference Queries

K.Ankamma chowdary
2012 IOSR Journal of Engineering  
In addition, we recommend an efficient algorithm for materialization and we express useful properties that reduce the cost of maintenance.  ...  Despite the wide assortment of location-based applications that rely on spatial predilection queries, existing algorithms incur non-negligible processing cost resulting in high retort time.  ...  In this paper, we offer a novel approach for processing spatial preference queries efficiently.  ... 
doi:10.9790/3021-021120817 fatcat:qigspgx4vbg5xewzigiiwpbcne

Efficient approximation of the maximal preference scores by lightweight cubic views

Yueguo Chen, Bin Cui, Xiaoyong Du, Anthony K. H. Tung
2012 Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12  
Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function.  ...  In this paper, we address the problem of efficient processing BPQs by using lightweight cubic (3-dimensional) views.  ...  CONCLUSION In this paper, we have proposed a special preference query called the best preference query, and a very efficient approximate solution to efficiently process such a query.  ... 
doi:10.1145/2247596.2247626 dblp:conf/edbt/ChenCDT12 fatcat:z2sc4qkjevgkfgbzrusd4nawly

MapReduce Algorithm for Location Recommendation by Using Area Skyline Query

Chen Li, Annisa Annisa, Asif Zaman, Mahboob Qaosar, Saleh Ahmed, Yasuhiko Morimoto
2018 Algorithms  
However, it is not efficient for large-scale data. In this paper, we propose a parallel algorithm for processing the area skyline using MapReduce.  ...  Intensive experiments on both synthetic and real data confirm that our proposed algorithm is sufficiently efficient for large-scale data.  ...  Three MapReduce based algorithms for skyline query processing, MR-BNL, MR-SFS, and MR-Bitmap, are proposed by Zhang et al. [16] .  ... 
doi:10.3390/a11120191 fatcat:uqs4qehcjzd5doceggt66ht5ly

CareDB

Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E. Khalefa
2010 Proceedings of the VLDB Endowment  
These issues are: (1) efficient and extensible core DBMS query processor support for numerous preference evaluation methods, (2) core dbms support for preference query processing in the face of expensive  ...  contextual data, and (3) support for continuous preference and context-aware query processing.  ...  The FlexPref join algorithm enables efficient preference evaluation for data that exists in multiple tables.  ... 
doi:10.14778/1920841.1921030 fatcat:nmzk7jn63bggjfza772uqxyo5e

FlexPref: A framework for extensible preference evaluation in database systems

Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E. Khalefa
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Core implementation provides efficient query processing for arbitrary database queries, however this approach is not practical as each existing (and future) preference method requires a custom query processor  ...  Once integrated, the preference method "lives" at the core of the database, enabling the efficient execution of preference queries involving common database operations.  ...  These functions are robust, as they can be used by FlexPref for various efficient query processing techniques as will be described in Section V.  ... 
doi:10.1109/icde.2010.5447881 dblp:conf/icde/LevandoskiMK10 fatcat:e4qn275xubezxkfyib5r2n3b5a

Mobile user-preference-based data dissemination on mobile P2P networks

Dohoon Kim, Young-Gab Kim, Hoh Peter In
2011 EURASIP Journal on Wireless Communications and Networking  
In this context, it is vital to efficiently disseminate data to be able to arrange hierarchal sequences of resource information of each mobile device for better search performance.  ...  In addition, the proposed HoMC-based Mobile User-preference-based Data Dissemination algorithm was simulated with a Qualnet simulator.  ...  The RBB algorithm is not efficient, though, since every mobile user calculates the expectation value to determine ranks, a process that is not always necessary.  ... 
doi:10.1186/1687-1499-2011-118 fatcat:a57id4zrnjfjdhsuf4oxuk4g6i

Scalable ranking for preference queries

Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
This paper proposes a scalable approach for memory-bounded top-k query processing.  ...  Top-k preference queries with multiple attributes are critical for decision-making applications.  ...  The algorithm to process sub-queries is not described here due to space limit [6] .  ... 
doi:10.1145/1099554.1099643 dblp:conf/cikm/FengAAS05 fatcat:r3br4gtqpbgrto4iqbm3ak6e6e

Branch-and-bound algorithm for reverse top-k queries

Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Yannis Kotidis
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
We propose an intuitive branch-and-bound algorithm for processing reverse top-k queries efficiently and discuss novel optimizations to boost its performance.  ...  Currently, the most efficient algorithm for computing the reverse top-k set is RTA.  ...  In this paper, we propose a branch-and-bound algorithm for efficient reverse top-k query processing.  ... 
doi:10.1145/2463676.2465278 dblp:conf/sigmod/VlachouDNK13 fatcat:56mcl6wcy5bo7luwbdqlduotzm
« Previous Showing results 1 — 15 out of 111,029 results