-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
QueryInvalidationIT.java
222 lines (190 loc) · 7.27 KB
/
QueryInvalidationIT.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
/*
* Copyright (c) 2002-2017 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.cypher;
import org.junit.Rule;
import org.junit.Test;
import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.ThreadLocalRandom;
import java.util.concurrent.atomic.AtomicInteger;
import org.neo4j.cypher.internal.compatibility.v3_3.CypherCacheHitMonitor;
import org.neo4j.cypher.internal.frontend.v3_3.ast.Query;
import org.neo4j.graphdb.Label;
import org.neo4j.graphdb.Result;
import org.neo4j.graphdb.Transaction;
import org.neo4j.graphdb.factory.GraphDatabaseSettings;
import org.neo4j.kernel.configuration.Config;
import org.neo4j.kernel.monitoring.Monitors;
import org.neo4j.test.rule.DatabaseRule;
import org.neo4j.test.rule.ImpermanentDatabaseRule;
import static java.util.Collections.singletonMap;
import static java.util.concurrent.TimeUnit.SECONDS;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
public class QueryInvalidationIT
{
private static final int USERS = 10;
private static final int CONNECTIONS = 100;
@Rule
public final DatabaseRule db = new ImpermanentDatabaseRule()
.withSetting( GraphDatabaseSettings.query_statistics_divergence_threshold, "0.5" )
.withSetting( GraphDatabaseSettings.cypher_min_replan_interval, "1s" );
@Test
public void shouldRePlanAfterDataChangesFromAnEmptyDatabase() throws Exception
{
// GIVEN
TestMonitor monitor = new TestMonitor();
db.resolveDependency( Monitors.class ).addMonitorListener( monitor );
// - setup schema -
createIndex();
// - execute the query without the existence data -
executeDistantFriendsCountQuery( USERS );
long replanTime = System.currentTimeMillis() + 1_800;
// - create data -
createData( 0, USERS, CONNECTIONS );
// - after the query TTL has expired -
while ( System.currentTimeMillis() < replanTime )
{
Thread.sleep( 100 );
}
// WHEN
monitor.reset();
// - execute the query again -
executeDistantFriendsCountQuery( USERS );
// THEN
assertEquals( "Query should have been replanned.", 1, monitor.discards.get() );
}
@Test
public void shouldRePlanAfterDataChangesFromAPopulatedDatabase() throws Exception
{
// GIVEN
Config config = db.getConfigCopy();
double divergenceThreshold = config.get( GraphDatabaseSettings.query_statistics_divergence_threshold );
long replanInterval = config.get( GraphDatabaseSettings.cypher_min_replan_interval );
TestMonitor monitor = new TestMonitor();
db.resolveDependency( Monitors.class ).addMonitorListener( monitor );
// - setup schema -
createIndex();
//create some data
createData( 0, USERS, CONNECTIONS );
executeDistantFriendsCountQuery( USERS );
long replanTime = System.currentTimeMillis() + replanInterval;
assertTrue( "Test does not work with edge setting for query_statistics_divergence_threshold: " + divergenceThreshold,
divergenceThreshold > 0.0 && divergenceThreshold < 1.0 );
int usersToCreate = ((int) (Math.ceil( ((double) USERS) / (1.0 - divergenceThreshold) ))) - USERS + 1;
//create more data
createData( USERS, usersToCreate, CONNECTIONS );
// - after the query TTL has expired -
while ( System.currentTimeMillis() <= replanTime )
{
Thread.sleep( 100 );
}
// WHEN
monitor.reset();
// - execute the query again -
executeDistantFriendsCountQuery( USERS );
// THEN
assertEquals( "Query should have been replanned.", 1, monitor.discards.get() );
}
private void createIndex()
{
try ( Transaction tx = db.beginTx() )
{
db.schema().indexFor( Label.label( "User" ) ).on( "userId" ).create();
tx.success();
}
try ( Transaction tx = db.beginTx() )
{
db.schema().awaitIndexesOnline( 10, SECONDS );
tx.success();
}
}
private void createData( long startingUserId, int numUsers, int numConnections )
{
for ( long userId = startingUserId; userId < numUsers + startingUserId; userId++ )
{
db.execute( "CREATE (newUser:User {userId: {userId}})", singletonMap( "userId", userId ) );
}
Map<String,Object> params = new HashMap<>();
for ( int i = 0; i < numConnections; i++ )
{
long user1 = startingUserId + randomInt( numUsers );
long user2;
do
{
user2 = startingUserId + randomInt( numUsers );
}
while ( user1 == user2 );
params.put( "user1", user1 );
params.put( "user2", user2 );
db.execute( "MATCH (user1:User { userId: {user1} }), (user2:User { userId: {user2} }) " +
"MERGE (user1) -[:FRIEND]- (user2)", params );
}
}
private void executeDistantFriendsCountQuery( int userId )
{
Map<String,Object> params = singletonMap( "userId", (long) randomInt( userId ) );
try ( Result result = db.execute(
"MATCH (user:User { userId: {userId} } ) -[:FRIEND]- () -[:FRIEND]- (distantFriend) " +
"RETURN COUNT(distinct distantFriend)", params ) )
{
while ( result.hasNext() )
{
result.next();
}
}
}
private static int randomInt( int max )
{
return ThreadLocalRandom.current().nextInt( max );
}
private static class TestMonitor implements CypherCacheHitMonitor<Query>
{
private final AtomicInteger hits = new AtomicInteger();
private final AtomicInteger misses = new AtomicInteger();
private final AtomicInteger discards = new AtomicInteger();
@Override
public void cacheHit( Query key )
{
hits.incrementAndGet();
}
@Override
public void cacheMiss( Query key )
{
misses.incrementAndGet();
}
@Override
public void cacheDiscard( Query key, String ignored )
{
discards.incrementAndGet();
}
@Override
public String toString()
{
return "TestMonitor{hits=" + hits + ", misses=" + misses + ", discards=" + discards + "}";
}
public void reset()
{
hits.set( 0 );
misses.set( 0 );
discards.set( 0 );
}
}
}