304 lines
6.7 KiB
C++
304 lines
6.7 KiB
C++
/*
|
|
----
|
|
This file is part of SECONDO.
|
|
|
|
Copyright (C) 2015,
|
|
Faculty of Mathematics and Computer Science,
|
|
Database Systems for New Applications.
|
|
|
|
SECONDO 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 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
SECONDO 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 SECONDO; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
----
|
|
|
|
*/
|
|
|
|
#ifndef DBSCAN_SETOFOBJECTSM_H
|
|
#define DBSCAN_SETOFOBJECTSM_H
|
|
|
|
#include "AlgebraTypes.h"
|
|
#include "Algebras/Relation-C++/RelationAlgebra.h"
|
|
#include "MMMTree.h"
|
|
#include "Algebras/MMRTree/TupleStore1.h"
|
|
#include "Stream.h"
|
|
#include "TupleInfo.h"
|
|
|
|
|
|
/*
|
|
1 Class SetOfObjectsM
|
|
|
|
This class provides an implementation of the setOfObjects for the
|
|
DBScan algorithm where the tuples are indexes by an m-tree.
|
|
|
|
The template parameters are the distance function
|
|
and the class to be cluster.
|
|
|
|
*/
|
|
|
|
|
|
namespace dbscan{
|
|
|
|
template <class D, class T>
|
|
class SetOfObjectsM{
|
|
|
|
public:
|
|
|
|
/*
|
|
1.1 Constructor
|
|
|
|
*/
|
|
|
|
SetOfObjectsM(Word _stream, ListExpr _tt, double _eps,
|
|
size_t _maxMem, int _attrPos, D _dist):
|
|
eps(_eps), attrPos(_attrPos), tree(0),
|
|
buffer(0), tupleStates(), tt(0), resIt(0), dist(_dist), dummy(0) {
|
|
tt = new TupleType(_tt);
|
|
initialize(_maxMem, _stream);
|
|
}
|
|
/*
|
|
1.2 Destructor
|
|
|
|
*/
|
|
~SetOfObjectsM(){
|
|
if(tree) delete tree;
|
|
if(buffer) delete buffer;
|
|
if(tt) tt->DeleteIfAllowed();
|
|
if(resIt) delete resIt;
|
|
}
|
|
|
|
/*
|
|
1.3 ~initOutput~
|
|
|
|
Starts the begin of returning tuples.
|
|
|
|
*/
|
|
void initOutput(){
|
|
if(resIt) delete resIt;
|
|
resIt = buffer->MakeScan();
|
|
}
|
|
|
|
|
|
/*
|
|
1.4 ~next~
|
|
|
|
Returns the next output tuple.
|
|
Requires the call of initOutput before.
|
|
|
|
*/
|
|
Tuple* next(){
|
|
assert(resIt);
|
|
Tuple* tuple = resIt->GetNextTuple();
|
|
if(!tuple){
|
|
return 0;
|
|
}
|
|
TupleId id = resIt->GetTupleId();
|
|
Tuple* resTuple = new Tuple(tt);
|
|
int as = tuple->GetNoAttributes();
|
|
|
|
for(int i = 0; i<as; i++){
|
|
resTuple->CopyAttribute(i,tuple,i);
|
|
}
|
|
tuple->DeleteIfAllowed();
|
|
resTuple->PutAttribute(as, new CcInt(true, tupleStates[id].clusterNo));
|
|
resTuple->PutAttribute(as+1, new CcBool(true,tupleStates[id].visited));
|
|
resTuple->PutAttribute(as+2, new CcBool(true,tupleStates[id].isCore));
|
|
return resTuple;
|
|
}
|
|
|
|
/*
|
|
1.5 makeScan
|
|
|
|
Returns an iterator over the input tuples. The caller of this function
|
|
is responsible to delete the iterator after usage.
|
|
|
|
*/
|
|
GenericRelationIterator* makeScan() {
|
|
return buffer->MakeScan();
|
|
}
|
|
|
|
/*
|
|
1.6 ~getProcessed~
|
|
|
|
Returns the processed state of a specified tuple.
|
|
|
|
*/
|
|
bool getProcessed(TupleId id){
|
|
return tupleStates[id].visited;
|
|
}
|
|
|
|
/*
|
|
1.7. ~setProcessed~
|
|
|
|
Changes the processed flag for a tuple.
|
|
|
|
*/
|
|
void setProcessed(TupleId id, bool value){
|
|
tupleStates[id].visited= value;
|
|
}
|
|
|
|
/*
|
|
1.8 ~getNeighbors~
|
|
|
|
Returns the neighbors of a tuple according to the epsilon value given
|
|
in the constructor. The caller of this function is responsible to delete
|
|
the returned list.
|
|
|
|
*/
|
|
std::list<TupleId>* getNeighbors(TupleId id){
|
|
Tuple* tuple = buffer->GetTuple(id);
|
|
T* obj = getAttribute(tuple, attrPos, dummy);
|
|
RangeIterator<std::pair<T*,TupleId>, D>* it
|
|
= tree->rangeSearch(std::make_pair(obj,id), eps);
|
|
std::list<TupleId>* res = new std::list<TupleId>();
|
|
|
|
while(it->hasNext()){
|
|
TupleId id2 = it->next()->second;
|
|
if(id!=id2){
|
|
res->push_back(id2);
|
|
}
|
|
}
|
|
delete it;
|
|
tuple->DeleteIfAllowed();
|
|
return res;
|
|
}
|
|
|
|
|
|
/*
|
|
1.9 ~getCluster~
|
|
|
|
Returns the current cluster id of a tuple.
|
|
|
|
*/
|
|
int getCluster(TupleId id){
|
|
return tupleStates[id].clusterNo;
|
|
}
|
|
|
|
/*
|
|
1.10 ~setCluster~
|
|
|
|
Changes the cluster id of a tuple.
|
|
|
|
*/
|
|
void setCluster(TupleId id, int value){
|
|
tupleStates[id].clusterNo = value;
|
|
}
|
|
|
|
/*
|
|
1.11 ~isSeed~
|
|
|
|
Checks whether the isSeed flag is set for a tuple.
|
|
|
|
*/
|
|
bool isSeed(TupleId id){
|
|
return tupleStates[id].isSeed;
|
|
}
|
|
|
|
bool isCore(TupleId id){
|
|
return tupleStates[id].isCore;
|
|
}
|
|
|
|
/*
|
|
1.12 ~setSeed~
|
|
|
|
Changes the seed flag for a tuple.
|
|
|
|
*/
|
|
void setSeed(TupleId id, bool value){
|
|
tupleStates[id].isSeed = value;
|
|
}
|
|
|
|
void setCore(TupleId id, bool value){
|
|
tupleStates[id].isCore = value;
|
|
}
|
|
|
|
/*
|
|
1.13 ~getAttribute~
|
|
|
|
Returns either the attribute of a tuple at a given position or the tuple itself,
|
|
depending on the template class T.
|
|
|
|
*/
|
|
T* getAttribute(Tuple *tuple, const int pos, Attribute *a) {
|
|
return (T*)(tuple->GetAttribute(pos));
|
|
}
|
|
|
|
T* getAttribute(Tuple *tuple, const int pos, Tuple *t) {
|
|
return tuple;
|
|
}
|
|
|
|
/*
|
|
1.13 ~isDefined~
|
|
|
|
Returns either the result of the IsDefined function from the Attribute class or
|
|
simply true, depending on the template class T.
|
|
|
|
*/
|
|
bool isDefined(Attribute *a) {
|
|
return a->IsDefined();
|
|
}
|
|
|
|
bool isDefined(Tuple *t) {
|
|
return true;
|
|
}
|
|
|
|
|
|
private:
|
|
|
|
/*
|
|
1.13 Members
|
|
|
|
*/
|
|
double eps; // epsilon value
|
|
int attrPos; // position of the rectangle attribute
|
|
MMMTree<std::pair<T*,TupleId>, D>* tree; // the index
|
|
TupleStore1* buffer; // buffer for input tuples
|
|
std::vector<TupleInfo> tupleStates; // structir stroing tuple states
|
|
TupleType* tt; // the result tuple type
|
|
GenericRelationIterator* resIt; // iterator
|
|
D dist; // distance function
|
|
T *dummy; // used for invocation of getAttribute function
|
|
|
|
/*
|
|
1.14 ~initialize~
|
|
|
|
Processes the complete input stream and builds an r-tree index on it.
|
|
|
|
*/
|
|
void initialize(size_t mem, Word _stream){
|
|
Tuple* tuple;
|
|
buffer = new TupleStore1(mem);
|
|
tree = new MMMTree<std::pair<T*,TupleId>, D>(4,8, dist);
|
|
Stream<Tuple> stream(_stream);
|
|
stream.open();
|
|
while((tuple = stream.request())){
|
|
TupleId id = buffer->AppendTuple(tuple);
|
|
T *obj = (T*)(getAttribute(tuple, attrPos, dummy));
|
|
if(isDefined(obj)){
|
|
std::pair<T*, TupleId> p(obj, id);
|
|
tree->insert(p);
|
|
}
|
|
TupleInfo info(false,-1);
|
|
tupleStates.push_back(info);
|
|
tuple->DeleteIfAllowed();
|
|
}
|
|
stream.close();
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|