8000 Bug fix/internal issue #316 by gnusi · Pull Request #7911 · arangodb/arangodb · GitHub
[go: up one dir, main page]

Skip to content

Bug fix/internal issue #316 #7911

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 26 commits into from
Jan 10, 2019
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
26 commits
Select commit Hold shift + click to select a range
714c08f
allow using scorers outside ArangoSearch view context
gnusi Dec 21, 2018
9bd05ae
ensure query is properly optimized after replacement of scorer functions
gnusi Dec 23, 2018
104c9db
do not apply `handleViewsRule` to queries without views
gnusi Dec 24, 2018
30a9e29
simplify optimization rule for ArangoSearch views
gnusi Dec 24, 2018
b440b63
show ArangoSearch view scorers in query explanation
gnusi Dec 25, 2018
31d273c
fix tests
gnusi Dec 25, 2018
0e5da98
Merge branch 'devel' of https://github.com/arangodb/arangodb into bug…
gnusi Dec 25, 2018
a6d1805
fix tests
gnusi Dec 26, 2018
3f985c0
add stub for scorer related tests
gnusi Dec 26, 2018
cffbead
Merge branch 'devel' of https://github.com/arangodb/arangodb into bug…
gnusi Jan 8, 2019
aa3ca2e
reformat
gnusi Jan 8, 2019
e0591ca
check variable depth in `ViewExpressionContext::getVariableValue`
gnusi Jan 8, 2019
6c7ef9e
add some tests
gnusi Jan 8, 2019
08504d2
address js test failures
gnusi Jan 8, 2019
a8bda86
address jslint errors
gnusi Jan 9, 2019
d930573
ensure `IResearchViewNode` exposes variables used in scorers
gnusi Jan 9, 2019
5733b0a
ensure scorers with expressions are deduplicated
gnusi Jan 9, 2019
4030503
fix deduplication for indexed access
gnusi Jan 10, 2019
ece771e
more tests
gnusi Jan 10, 2019
6ebe204
partially address review comments
gnusi Jan 10, 2019
6772e87
address review comments
gnusi Jan 10, 2019
99779ce
simplify code
gnusi Jan 10, 2019
bb0d969
remove irrelevant, commented out code
gnusi Jan 10, 2019
b8ccf1b
merge
gnusi Jan 10, 2019
f3af469
ensure array comparisons are properly handled
gnusi Jan 10, 2019
886f19f
update changelog & loki
gnusi Jan 10, 2019
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
fix tests
  • Loading branch information
gnusi committed Dec 25, 2018
commit 31d273c3c2837f1592a7f186d2da231295927a16
11 changes: 10 additions & 1 deletion arangod/IResearch/AqlHelper.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -161,14 +161,19 @@ size_t hash(aql::AstNode const* node, size_t hash /*= 0*/) noexcept {
case aql::NODE_TYPE_ATTRIBUTE_ACCESS: {
hash = fasthash64(static_cast<const void*>("access"), 6, hash);

// FIXME

struct Visitor {
explicit Visitor(size_t& hash) noexcept
: hash(hash) {
}

bool attributeAccess(arangodb::aql::AstNode const& node) noexcept {
irs::string_ref value;
parseValue(value, node);

hash = fasthash64(static_cast<const void*>("attribute"), 9, hash);
hash = iresearch::hash(&node, hash);
hash = fasthash64(value.c_str(), value.size(), hash);
return true;
}

Expand All @@ -189,6 +194,10 @@ size_t hash(aql::AstNode const* node, size_t hash /*= 0*/) noexcept {
aql::AstNode const* head = nullptr;
visitAttributeAccess(head, node, hasher);

if (head) {
hash = fasthash64(head, sizeof(head), hash);
}

return hash;
}

Expand Down
68 changes: 0 additions & 68 deletions arangod/IResearch/AqlHelper.h
10000
Original file line number Diff line number Diff line change
Expand Up @@ -443,74 +443,6 @@ bool visitAttributeAccess(
}
}

////////////////////////////////////////////////////////////////////////////////
/// @brief interprets the specified node as an attribute path description and
/// visits the members in attribute path order calling the provided
/// 'visitor' on each path sub-index, expecting the following signatures:
/// bool operator()(irs::string_ref) - string keys
/// bool operator()(int64_t) - array offsets
/// bool operator()() - any string key or numeric offset
/// @return success and set head the the starting node of path (reference/value)
////////////////////////////////////////////////////////////////////////////////
template<typename T>
bool visitAttributePath(
aql::AstNode const*& head,
aql::AstNode const& node,
T& visitor
) {
if (node.numMembers() >= 2
&& aql::NODE_TYPE_EXPANSION == node.type) { // [*]
auto* itr = node.getMemberUnchecked(0);
auto* ref = node.getMemberUnchecked(1);

if (itr && itr->numMembers() == 2) {
auto* root = itr->getMemberUnchecked(1);
auto* var = itr->getMemberUnchecked(0);

return ref
&& aql::NODE_TYPE_ITERATOR == itr->type
&& aql::NODE_TYPE_REFERENCE == ref->type
&& root && var
&& aql::NODE_TYPE_VARIABLE == var->type
&& visitAttributePath(head, *root, visitor) // 1st visit root
&& visitor(); // 2nd visit current node
}
} else if (node.numMembers() == 2
&& aql::NODE_TYPE_INDEXED_ACCESS == node.type) { // [<something>]
auto* root = node.getMemberUnchecked(0);
auto* offset = node.getMemberUnchecked(1);

if (offset && offset->isIntValue()) {
return root
&& offset->getIntValue() >= 0
&& visitAttributePath(head, *root, visitor) // 1st visit root
&& visitor(offset->getIntValue()); // 2nd visit current node
}

return root && offset && offset->isStringValue()
&& visitAttributePath(head, *root, visitor) // 1st visit root
&& visitor(iresearch::getStringRef(*offset)); // 2nd visit current node
} else if (node.numMembers() == 1
&& aql::NODE_TYPE_ATTRIBUTE_ACCESS == node.type) {
auto* root = node.getMemberUnchecked(0);

return root
&& aql::VALUE_TYPE_STRING == node.value.type
&& visitAttributePath(head, *root, visitor) // 1st visit root
&& visitor(iresearch::getStringRef(node)); // 2nd visit current node
} else if (!node.numMembers()) { // end of attribute path (base case)
head = &node;

return aql::NODE_TYPE_REFERENCE == node.type
|| (aql::NODE_TYPE_VALUE == node.type
&& aql::VALUE_TYPE_STRING == node.value.type
&& visitor(iresearch::getStringRef(node))
);
}

return false;
}

struct NormalizedCmpNode {
aql::AstNode const* attribute;
aql::AstNode const* value;
Expand Down
2 changes: 1 addition & 1 deletion arangod/IResearch/IResearchOrderFactory.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -278,7 +278,7 @@ void ScorerReplacer::replace(aql::CalculationNode& node) {
return node;
}

Scorer const key(ref, node);
HashedScorer const key(ref, node);

auto it = _dedup.find(key);

Expand Down
19 changes: 15 additions & 4 deletions arangod/IResearch/IResearchOrderFactory.h
Original file line number Diff line number Diff line change
Expand Up @@ -148,20 +148,31 @@ class ScorerReplacer {
}

private:
struct HashedScorer : Scorer {
HashedScorer(
aql::Variable const* var,
aql::AstNode const* node
) : Scorer(var, node),
hash(iresearch::hash(node)) {
}

size_t hash;
}; // HashedScorer

struct ScorerHash {
size_t operator()(Scorer const& key) const noexcept {
return iresearch::hash(key.node);
size_t operator()(HashedScorer const& key) const noexcept {
return key.hash;
}
}; // ScorerHash

struct ScorerEqualTo {
bool operator()(Scorer const& lhs, Scorer const& rhs) const {
bool operator()(HashedScorer const& lhs, HashedScorer const& rhs) const {
return iresearch::equalTo(lhs.node, rhs.node);
}
}; // ScorerEqualTo

typedef std::unordered_map<
Scorer, aql::Variable const*, ScorerHash, ScorerEqualTo
HashedScorer, aql::Variable const*, ScorerHash, ScorerEqualTo
> DedupScorers;

DedupScorers _dedup;
Expand Down
2 changes: 1 addition & 1 deletion arangod/IResearch/IResearchViewOptimizerRules.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -217,7 +217,7 @@ void handleViewsRule(
auto const funcName = iresearch::getFuncName(*scorer.node);

THROW_ARANGO_EXCEPTION_FORMAT(
TRI_ERROR_QUERY_PARSE,
TRI_ERROR_QUERY_FUNCTION_ARGUMENT_TYPE_MISMATCH,
"Non ArangoSearch view variable '%s' is used in scorer function '%s'",
scorer.var->name.c_str(),
funcName.c_str()
Expand Down
89 changes: 81 additions & 8 deletions tests/IResearch/IResearchQueryJoin-test.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1362,12 +1362,6 @@ TEST_CASE("IResearchQueryTestJoin", "[iresearch][iresearch-query]") {
}

// invalid reference in scorer
//
// FOR x IN 0..5
// FOR d IN testView
// SEARCH d.seq == x
// SORT customscorer(x,x)
// RETURN d;
{
std::string const query = "FOR d IN testView FOR i IN 0..5 SORT tfidf(i) DESC RETURN d";

Expand All @@ -1376,7 +1370,7 @@ TEST_CASE("IResearchQueryTestJoin", "[iresearch][iresearch-query]") {
));

auto queryResult = arangodb::tests::executeQuery(vocbase, query);
REQUIRE(TRI_ERROR_NOT_IMPLEMENTED == queryResult.code);
REQUIRE(TRI_ERROR_QUERY_FUNCTION_ARGUMENT_TYPE_MISMATCH == queryResult.code);
}

// FOR i IN 1..5
Expand Down Expand Up @@ -1457,6 +1451,85 @@ TEST_CASE("IResearchQueryTestJoin", "[iresearch][iresearch-query]") {
CHECK(expectedDoc == expectedDocs.end());
}

{
std::string const query = "LET attr = _NONDETERM_('seq') "
"FOR i IN 1..5 "
" FOR x IN collection_1 FILTER x.seq == i "
" FOR d IN testView SEARCH d.seq == x.seq AND d.name == x.name "
" SORT customscorer(d, x[attr]) DESC "
"RETURN d";

CHECK(arangodb::tests::assertRules(
vocbase, query,
{
arangodb::aql::OptimizerRule::handleArangoSearchViewsRule,
}
));

std::vector<arangodb::velocypack::Slice> expectedDocs {
arangodb::velocypack::Slice(insertedDocsView[4].vpack()),
arangodb::velocypack::Slice(insertedDocsView[2].vpack()),
};

auto queryResult = arangodb::tests::executeQuery(vocbase, query);
REQUIRE(TRI_ERROR_NO_ERROR == queryResult.code);

auto result = queryResult.result->slice();
CHECK(result.isArray());

arangodb::velocypack::ArrayIterator resultIt(result);
REQUIRE(expectedDocs.size() == resultIt.size());

// Check documents
auto expectedDoc = expectedDocs.begin();
for (;resultIt.valid(); resultIt.next(), ++expectedDoc) {
auto const actualDoc = resultIt.value();
auto const resolved = actualDoc.resolveExternals();

CHECK((0 == arangodb::basics::VelocyPackHelper::compare(arangodb::velocypack::Slice(*expectedDoc), resolved, true)));
}
CHECK(expectedDoc == expectedDocs.end());
}

// FOR i IN 1..5
// FOR x IN collection_0 SEARCH x.seq == i
// FOR d IN SEARCH d.seq == x.seq && d.name == x.name
// SORT customscorer(d, x.seq)
{
std::string const query = "FOR i IN 1..5 FOR x IN collection_1 FILTER x.seq == i FOR d IN testView SEARCH d.seq == x.seq AND d.name == x.name SORT customscorer(d, x['seq']) DESC RETURN d";

CHECK(arangodb::tests::assertRules(
vocbase, query,
{
arangodb::aql::OptimizerRule::handleArangoSearchViewsRule,
}
));

std::vector<arangodb::velocypack::Slice> expectedDocs {
arangodb::velocypack::Slice(insertedDocsView[4].vpack()),
arangodb::velocypack::Slice(insertedDocsView[2].vpack()),
};

auto queryResult = arangodb::tests::executeQuery(vocbase, query);
REQUIRE(TRI_ERROR_NO_ERROR == queryResult.code);

auto result = queryResult.result->slice();
CHECK(result.isArray());

arangodb::velocypack::ArrayIterator resultIt(result);
REQUIRE(expectedDocs.size() == resultIt.size());

// Check documents
auto expectedDoc = expectedDocs.begin();
for (;resultIt.valid(); resultIt.next(), ++expectedDoc) {
auto const actualDoc = resultIt.value();
auto const resolved = actualDoc.resolveExternals();

CHECK((0 == arangodb::basics::VelocyPackHelper::compare(arangodb::velocypack::Slice(*expectedDoc), resolved, true)));
}
CHECK(expectedDoc == expectedDocs.end());
}

// unable to retrieve `d.seq` from self-referenced variable
// FOR i IN 1..5
// FOR d IN SEARCH d.seq == i SORT customscorer(d, d.seq)
Expand Down Expand Up @@ -1687,4 +1760,4 @@ TEST_CASE("IResearchQueryTestJoin", "[iresearch][iresearch-query]") {

// -----------------------------------------------------------------------------
// --SECTION-- END-OF-FILE
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
0