-
Notifications
You must be signed in to change notification settings - Fork 0
/
PhysicalGroupedAggregateUnitTest.cpp
309 lines (278 loc) · 11.6 KB
/
PhysicalGroupedAggregateUnitTest.cpp
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
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
/*
**
* BEGIN_COPYRIGHT
*
* This file is part of SciDB.
* Copyright (C) 2008-2014 SciDB, Inc.
*
* SciDB is free software: you can redistribute it and/or modify
* it under the terms of the AFFERO GNU General Public License as published by
* the Free Software Foundation.
*
* SciDB is distributed "AS-IS" AND WITHOUT ANY WARRANTY OF ANY KIND,
* INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY,
* NON-INFRINGEMENT, OR FITNESS FOR A PARTICULAR PURPOSE. See
* the AFFERO GNU General Public License for the complete license terms.
*
* You should have received a copy of the AFFERO GNU General Public License
* along with SciDB. If not, see <http://www.gnu.org/licenses/agpl-3.0.html>
*
* END_COPYRIGHT
*/
#include <query/Operator.h>
#include <array/Metadata.h>
#include <system/Cluster.h>
#include <query/Query.h>
#include <boost/make_shared.hpp>
#include <boost/foreach.hpp>
#include <system/Exceptions.h>
#include <system/Utils.h>
#include <log4cxx/logger.h>
#include <util/NetworkMessage.h>
#include <array/RLE.h>
#include <array/SortArray.h>
using namespace boost;
using namespace std;
namespace scidb
{
static log4cxx::LoggerPtr logger(log4cxx::Logger::getLogger("scidb.unittest"));
class PhysicalGroupedAggregate: public PhysicalOperator
{
typedef map<Coordinate, Value> CoordValueMap;
typedef std::pair<Coordinate, Value> CoordValueMapEntry;
public:
PhysicalGroupedAggregate(const string& logicalName, const string& physicalName,
const Parameters& parameters, const ArrayDesc& schema)
: PhysicalOperator(logicalName, physicalName, parameters, schema)
{
}
void preSingleExecute(shared_ptr<Query> query)
{
}
/**
* Generate a random value.
* The function should be extended to cover all types and all special values such as NaN, and then be moved to a public header file.
* @param[in] type the type of the value
* @param[inout] value the value to be filled
* @param[in] percentNull a number from 0 to 100, where 0 means never generate null, and 100 means always generate null
* @return the value from the parameter
*/
Value& genRandomValue(TypeId const& type, Value& value, int percentNull, int nullReason)
{
assert(percentNull>=0 && percentNull<=100);
if (percentNull>0 && rand()%100<percentNull) {
value.setNull(nullReason);
} else if (type==TID_INT64) {
value.setInt64(rand());
} else if (type==TID_BOOL) {
value.setBool(rand()%100<50);
} else if (type==TID_STRING) {
vector<char> str;
const size_t maxLength = 300;
const size_t minLength = 1;
assert(minLength>0);
size_t length = rand()%(maxLength-minLength) + minLength;
str.resize(length + 1);
for (size_t i=0; i<length; ++i) {
int c;
do {
c = rand()%128;
} while (! isalnum(c));
str[i] = (char)c;
}
str[length-1] = 0;
value.setString(&str[0]);
} else {
throw SYSTEM_EXCEPTION(SCIDB_SE_INTERNAL, SCIDB_LE_UNITTEST_FAILED)
<< "UnitTestSortArrayPhysical" << "genRandomValue";
}
return value;
}
/**
* Given a value, return a human-readable string for its value.
* @note This should eventually be factored out to the include/ directory.
* @see ArrayWriter
*/
string valueToString(Value const& value, TypeId const& type)
{
std::stringstream ss;
if (value.isNull()) {
ss << "?(" << value.getMissingReason() << ")";
} else if (type==TID_INT64) {
ss << value.getInt64();
} else if (type==TID_BOOL) {
ss << (value.getBool() ? "true" : "false");
} else if (type==TID_STRING) {
ss << value.getString();
} else {
throw SYSTEM_EXCEPTION(SCIDB_SE_INTERNAL, SCIDB_LE_UNITTEST_FAILED)
<< "UnitTestSortArrayPhysical" << "value2string";
}
return ss.str();
}
/**
* Insert data from a map to an array.
* @param[in] query
* @param[inout] array the array to receive data
* @param[in] m the map of Coordinate --> Value
*/
void insertMapDataIntoArray(shared_ptr<Query>& query, MemArray& array, CoordValueMap const& m)
{
Coordinates coord(1);
coord[0] = 0;
vector< shared_ptr<ArrayIterator> > arrayIters(array.getArrayDesc().getAttributes(true).size());
vector< shared_ptr<ChunkIterator> > chunkIters(arrayIters.size());
for (size_t i = 0; i < arrayIters.size(); i++)
{
arrayIters[i] = array.getIterator(i);
chunkIters[i] =
((MemChunk&)arrayIters[i]->newChunk(coord)).getIterator(query,
ChunkIterator::SEQUENTIAL_WRITE);
}
BOOST_FOREACH(CoordValueMapEntry const& p, m) {
coord[0] = p.first;
for (size_t i = 0; i < chunkIters.size(); i++)
{
if (!chunkIters[i]->setPosition(coord))
{
chunkIters[i]->flush();
chunkIters[i].reset();
chunkIters[i] =
((MemChunk&)arrayIters[i]->newChunk(coord)).getIterator(query,
ChunkIterator::SEQUENTIAL_WRITE);
chunkIters[i]->setPosition(coord);
}
chunkIters[i]->writeItem(p.second);
}
}
for (size_t i = 0; i < chunkIters.size(); i++)
{
chunkIters[i]->flush();
}
}
/**
* Test sort array once.
* The method generates a large 1-d array of random values.
* It then tries to sort the array by the first attributes.
* For each cell, there is 0% possibility that it is empty.
* For each value, there is 0% possibility that it is null.
* For each cell, the value in each attribute is the same
* so that we can be sure the sort does not scramble cells.
*
* @param[in] query
* @param[in] type the value type
* @param[in] start the start coordinate of the dim
* @param[in] end the end coordinate of the dim
* @param[in] chunkInterval the chunk interval
*
* @throw SCIDB_SE_INTERNAL::SCIDB_LE_UNITTEST_FAILED
*/
void testOnce_SortArray(boost::shared_ptr<Query>& query,
TypeId const& type,
Coordinate start,
Coordinate end,
size_t nattrs,
bool ascent,
uint32_t chunkInterval)
{
const int percentEmpty = 20;
const int percentNullValue = 10;
const int missingReason = 0;
LOG4CXX_DEBUG(logger, "SortArray UnitTest Attempt [type=" << type << "][start=" << start << "][end=" << end <<
"][nattrs=" << nattrs << "][ascent=" << ascent << "]");
// Array schema
vector<AttributeDesc> attributes(nattrs);
for (size_t i = 0; i < nattrs; i++)
{
std::stringstream ss;
ss << "X" << i;
attributes[i] = AttributeDesc((AttributeID)0, ss.str(), type, AttributeDesc::IS_NULLABLE, 0);
}
vector<DimensionDesc> dimensions(1);
dimensions[0] = DimensionDesc(string("dummy_dimension"), start, end, chunkInterval, 0);
ArrayDesc schema("dummy_array", addEmptyTagAttribute(attributes), dimensions);
// Sort Keys
SortingAttributeInfos sortingAttributeInfos;
SortingAttributeInfo k;
k.columnNo = 0;
k.ascent = ascent;
sortingAttributeInfos.push_back(k);
// Define the array to sort
shared_ptr<MemArray> arrayInst(new MemArray(schema,query));
shared_ptr<Array> baseArrayInst = static_pointer_cast<MemArray, Array>(arrayInst);
// Generate source data
CoordValueMap mapInst;
Value value;
for (Coordinate i=start; i<end+1; ++i) {
if (! rand()%100<percentEmpty) {
mapInst[i] = genRandomValue(type, value, percentNullValue, missingReason);
}
}
// Insert the map data into the array.
insertMapDataIntoArray(query, *arrayInst, mapInst);
// Sort
const bool preservePositions = false;
SortArray sorter(schema, _arena, preservePositions);
shared_ptr<TupleComparator> tcomp(new TupleComparator(sortingAttributeInfos, schema));
shared_ptr<MemArray> sortedArray = sorter.getSortedArray(baseArrayInst, query, tcomp);
// Check correctness.
// - Retrieve all data from the array. Ensure results are sorted.
for (size_t j = 0; j < nattrs; j++)
{
Value t1[1];
Value t2[1];
size_t itemCount = 0;
shared_ptr<ConstArrayIterator> constArrayIter = sortedArray->getConstIterator(j);
constArrayIter->reset();
while (!constArrayIter->end())
{
shared_ptr<ConstChunkIterator> constChunkIter =
constArrayIter->getChunk().getConstIterator(ChunkIterator::IGNORE_EMPTY_CELLS);
while (!constChunkIter->end())
{
itemCount++;
Value const& v = constChunkIter->getItem();
t1[0] = v;
++(*constChunkIter);
if (!constChunkIter->end())
{
Value const& next = constChunkIter->getItem();
t2[0] = next;
if (tcomp->compare(t1, t2) > 0)
{
stringstream ss;
ss << "elements in attr " << j << " are out of order";
throw SYSTEM_EXCEPTION(SCIDB_SE_INTERNAL, SCIDB_LE_UNITTEST_FAILED) <<
"UnitTestSortArray" << ss.str();
}
}
}
++(*constArrayIter);
}
if (itemCount != mapInst.size())
{
stringstream ss;
ss << "wrong # of elements in attr " << j << " expected: " << mapInst.size() <<
" got: " << itemCount;
throw SYSTEM_EXCEPTION(SCIDB_SE_INTERNAL, SCIDB_LE_UNITTEST_FAILED) <<
"UnitTestSortArray" << ss.str();
}
}
LOG4CXX_DEBUG(logger, "SortArray UnitTest Success [type=" << type << "][start=" << start << "][end=" << end <<
"][nattrs=" << nattrs << "][ascent=" << ascent << "]");
}
boost::shared_ptr<Array> execute(vector< boost::shared_ptr<Array> >& inputArrays, boost::shared_ptr<Query> query)
{
srand(time(NULL));
testOnce_SortArray(query, TID_INT64, 0, 1000, 1, true, 100);
testOnce_SortArray(query, TID_INT64, 0, 1000, 1, false, 100);
testOnce_SortArray(query, TID_INT64, 0, 1000, 3, true, 100);
testOnce_SortArray(query, TID_STRING, 0, 1000, 1, true, 100);
testOnce_SortArray(query, TID_STRING, 0, 1000, 1, false, 100);
testOnce_SortArray(query, TID_STRING, 0, 1000, 3, true, 100);
testOnce_SortArray(query, TID_INT64, 0, 5000000, 3, true, 10000);
return shared_ptr<Array> (new MemArray(_schema,query));
}
};
REGISTER_PHYSICAL_OPERATOR_FACTORY(PhysicalGroupedAggregate, "grouped_aggregate", "physical_grouped_aggregate");
}