aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorFederico Igne <federico.igne@cs.ox.ac.uk>2022-05-18 15:34:23 +0100
committerFederico Igne <federico.igne@cs.ox.ac.uk>2022-05-18 15:41:21 +0100
commit3513f271816618fc453738581889e677861473de (patch)
tree426aa434dcebcb3005d00252daf2d4ee9a118400
parent6bfca605a1c76dfe73b123ec96bd49d084860866 (diff)
downloadACQuA-3513f271816618fc453738581889e677861473de.tar.gz
ACQuA-3513f271816618fc453738581889e677861473de.zip
fix: allow bounds update even when the bounds gap is emptyv0.2.0
This is needed for now because PAGOdA's upper bound is not *always complete*. In this way we can fix its mistake by using RSAComb (or any other lower bound approximation service).
-rw-r--r--src/main/java/uk/ac/ox/cs/pagoda/query/QueryRecord.java4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/main/java/uk/ac/ox/cs/pagoda/query/QueryRecord.java b/src/main/java/uk/ac/ox/cs/pagoda/query/QueryRecord.java
index 1fb4ed7..be19734 100644
--- a/src/main/java/uk/ac/ox/cs/pagoda/query/QueryRecord.java
+++ b/src/main/java/uk/ac/ox/cs/pagoda/query/QueryRecord.java
@@ -117,9 +117,9 @@ public class QueryRecord extends Disposable {
117 boolean update = false; 117 boolean update = false;
118 for(AnswerTuple tuple; answerTuples.isValid(); answerTuples.moveNext()) { 118 for(AnswerTuple tuple; answerTuples.isValid(); answerTuples.moveNext()) {
119 tuple = answerTuples.getTuple(); 119 tuple = answerTuples.getTuple();
120 if(!soundAnswerTuples.contains(tuple) && (gapAnswerTuples == null || gapAnswerTuples.contains(tuple))) { 120 if(!soundAnswerTuples.contains(tuple)) {
121 soundAnswerTuples.add(tuple); 121 soundAnswerTuples.add(tuple);
122 if(gapAnswerTuples != null) 122 if(gapAnswerTuples != null && gapAnswerTuples.contains(tuple))
123 gapAnswerTuples.remove(tuple); 123 gapAnswerTuples.remove(tuple);
124 update = true; 124 update = true;
125 } 125 }