Filters








106,470 Hits in 4.4 sec

The Reverse Problem of Range Query

Tadao Takaoka
2003 Electronical Notes in Theoretical Computer Science  
doi:10.1016/s1571-0661(04)81018-1 fatcat:memmlzlwgvdm3m5t3jmsli3sou

Influence sets based on reverse nearest neighbor queries

Flip Korn, S. Muthukrishnan
2000 Proceedings of the 2000 ACM SIGMOD international conference on Management of data - SIGMOD '00  
Standard approaches to determining the in uence set of a data point i n volve range searching and nearest neighbor queries.  ...  In uence sets based on reverse nearest neighbor RNN queries seem to capture the intuitive notion of in uence from our motivating examples.  ...  Acknowledgements The authors wish to thank Christos Faloutsos, Dimitris Gunopoulos, H.V. Jagadish, Nick Koudas, and Dennis Shasha for their comments.  ... 
doi:10.1145/342009.335415 dblp:conf/sigmod/KornM00 fatcat:6fof7umbkrgxvofyye3ropiglu

A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries

Oscar H. Ibarra, Jianwen Su
1999 Journal of computer and system sciences (Print)  
We also use the counter machine technique to show that for a syntactically restricted subclass of first-order queries with linear constraints over Z and N, the containment and equivalence problems are  ...  For a subclass, called SQL-like conjunctive queries, the problems are shown to have a polynomial space upper bound.  ...  ACKNOWLEDGMENT The authors thank Moshe Vardi for suggesting the reduction to first-order theories used in the proof of Lemma 4.4.  ... 
doi:10.1006/jcss.1999.1624 fatcat:dv4co6nrfza3vhfpf7vuus6lki

Reverse Skyline Computation over Sliding Windows

Junchang Xin, Zhiqiong Wang, Mei Bai, Guoren Wang
2015 Mathematical Problems in Engineering  
We first theoretically analyzed the inherent properties of reverse skyline on data streams and proposed a novel pruning technique to reduce the number of data points preserved for processing continuous  ...  reverse skyline queries.  ...  If the current label is , we execute a range query Through retrieving the whole 2D -tree index, we can find all the -of-reverse skyline points. 5.2. ( 1 , 2 )-of-Reverse Skyline.  ... 
doi:10.1155/2015/649271 fatcat:o4o4i5udivadzgdpo36jfpsfqa

Efficient Computation of Reverse Skyline Queries

Evangelos Dellis, Bernhard Seeger
2007 Very Large Data Bases Conference  
At first, we consider for a multidimensional data set P the problem of dynamic skyline queries according to a query point q.  ...  In this paper, for the first time, we introduce the concept of Reverse Skyline Queries.  ...  The authors would like to thank Ilya Vladimirskiy for initiating discussions that led to this paper.  ... 
dblp:conf/vldb/DellisS07 fatcat:wn6gpko32vecrf4mnmkx5bc55m

Smallest Set for Reverse Selection Queries to Satisfy All

Muhammed Miah
2017 International Journal of Science and Engineering Applications  
The problem is an interesting variant of the Maximal Reverse Selection Queries Problem (also referred to as the Tuple Design Problem) introduced by Miah et al. (2016).  ...  This paper considers the Smallest Set Reverse Selection Queries Problem also known as the Multiple Tuple Design Problem: Given a set of selection queries with conjunctive conditions, where the task is  ...  This focused on the maximal reverse queries problem on the important class of "selection queries" over Boolean databases.  ... 
doi:10.7753/ijsea0603.1006 fatcat:xcntif4dk5aqfhg2iifxpfuexa

Inverse Queries for Multidimensional Spaces [chapter]

Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Shiming Zhang, Andreas Züfle
2011 Lecture Notes in Computer Science  
This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain  ...  In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries.  ...  The problem of this method is that running a reverse query for each q i multiplies the complexity of the reverse query by |Q| both in terms of computational and I/O-cost.  ... 
doi:10.1007/978-3-642-22922-0_20 fatcat:jwdqghhlmfcu3gz5ms4ndngudm

On answering why and why-not questions in databases

M. S. Islam
2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
The main goals of this research are: (i) studying the problem of answering the why and the why-not questions in databases; (ii) finding efficient strategies for answering these questions in terms of different  ...  query settings and (iii) finally, developing a framework that can take advantage of the existing data indexing and query evaluation techniques available to answer such questions in databases.  ...  In this work [15] , we study the problem of answering why-not question in reverse skyline queries.  ... 
doi:10.1109/icdew.2013.6547468 dblp:conf/icde/Islam13 fatcat:eqtwv7jz6ndqfpp6l3t4xjfo3u

Nearest Neighbors Problem [chapter]

D. J. O'Neil
2016 Encyclopedia of GIS  
SYNONYMS nearest neighbor, all-nearest-neighbors, all-k-nearest neighbors, reverse-nearestneighbor-problem, reverse-k-nearest-neighbors aNN, akNN, rNN, rkNN, range query DEFINITION Given a set of n points  ...  Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q. The right shows the problem solution, s.  ...  Within the GIS context, nearest neighbor problems are common in spatial queries where a user wants to know the closest objects, usually of some type, nearest to a query point.  ... 
doi:10.1007/978-3-319-23519-6_869-2 fatcat:nxmkyioqpvcpljvs3l2fje42nm

Nearest Neighbors Problem [chapter]

D.J. O'Neil
2008 Encyclopedia of GIS  
SYNONYMS nearest neighbor, all-nearest-neighbors, all-k-nearest neighbors, reverse-nearestneighbor-problem, reverse-k-nearest-neighbors aNN, akNN, rNN, rkNN, range query DEFINITION Given a set of n points  ...  Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q. The right shows the problem solution, s.  ...  Within the GIS context, nearest neighbor problems are common in spatial queries where a user wants to know the closest objects, usually of some type, nearest to a query point.  ... 
doi:10.1007/978-0-387-35973-1_869 fatcat:rqixgtsorne67kkl4deorqbmhi

Finding Causality and Responsibility for Probabilistic Reverse Skyline Query Non-Answers

Yunjun Gao, Qing Liu, Gang Chen, Linlin Zhou, Baihua Zheng
2017 2017 IEEE 33rd International Conference on Data Engineering (ICDE)  
In this paper, we study the causality and responsibility problem (CRP) for the non-answers to probabilistic reverse skyline queries (PRSQ).  ...  Further, we explore the CRP for the non-answers to reverse skyline queries.  ...  Reverse Skyline Queries The problem of reverse skyline queries has received much attention in the database community, since it was originally introduced by Dellis et al. [14] .  ... 
doi:10.1109/icde.2017.33 dblp:conf/icde/GaoL0ZZ17 fatcat:bftghgtrwracnk36yvjf3w4bea

Hub Labels on the database for large-scale graphs with the COLD framework

Alexandros Efentakis, Christodoulos Efstathiades, Dieter Pfoser
2017 Geoinformatica  
Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory.  ...  Our COLD framework (COmpressed Labels on the Database) may answer multiple distance queries (vertex-to-vertex, one-tomany, k-Nearest Neighbors, Reverse k-Nearest Neighbors, Reverse k-Farthest Neighbors  ...  Pfoser's work was partially supported by the NGA NURI grant HM02101410004.  ... 
doi:10.1007/s10707-016-0287-5 fatcat:sqz7o5bogbgevaq6iafh3ifa4e

Answering why-not questions on reverse top-kqueries

Yunjun Gao, Qing Liu, Gang Chen, Baihua Zheng, Linlin Zhou
2015 Proceedings of the VLDB Endowment  
Extensive experimental evaluation using both real and synthetic data sets verifies the effectiveness and efficiency of the presented algorithms. Parameter Range Default Dimensionality d  ...  Given an initial reverse top-k query and a missing/why-not weighting vector set W m that is absent from the query result, why-not questions on reverse top-k queries explain why W m does not appear in the  ...  of the reverse top-k′ query of q.  ... 
doi:10.14778/2752939.2752943 fatcat:4lf532s3rjdxpevy33i27bfhtu

Private Reverse Top-k Algorithms Applied on Public Data of COVID-19 in the State of Ceará

Maria de Lourdes M. Silva, Iago C. Chaves, Javam C. Machado
2021 Journal of Information and Data Management  
In this article we propose a differentially private reverse top-k query.  ...  Our experimental results show that the result of the proposed top-k query returns a high degree of similarity to the result of a conventional top-k query, when the chosen budget is suitable, providing  ...  RELATED WORK Several works address the top-k problem privately; however, the literature lacks studies in the context of private reverse top-k.  ... 
doi:10.5753/jidm.2021.1941 fatcat:5nvof7uhr5fw5ozj6kzwk5zaea

Reverse Chaining for Answering Temporal Logical Queries

Y. Manolopoulos
1992 Computer journal  
With this book, there is at last a unifying overview of the whole range of problems relating to software reuse that are carefully and perceptively related to each other and distilled into a series of detailed  ...  The motivation of the present work is a previous effort on the performance analysis of such systems, 1 where a formula was given deriving the cost of answering logical queries by using reverse chaining  ... 
doi:10.1093/comjnl/35.6.666 fatcat:hpit7f2iwbhpzdjat45qfjo3ra
« Previous Showing results 1 — 15 out of 106,470 results