+void lex_index::preorderTraverse(xml_tree * tree, xml_tree::tag_t parent_tag, xml_tree::node_t node){
+ if (tree->tag(node)==tree->PCDATA_OPEN_TAG_ID)
+ if (parent_tag==tag) tagVector.push_back(tree->text_id(node));
+ else if (parent_tag==tag2) tag2Vector.push_back(tree->text_id(node));
+ if (tree->tag(tree->first_child(node))!=0) preorderTraverse(tree,tree->tag(node),tree->first_child(node));
+ if (tree->tag(tree->next_sibling(node))!=0) preorderTraverse(tree,parent_tag,tree->next_sibling(node));
+}
+
+void lex_index::createIndex(xml_tree * tree){
+ preorderTraverse(tree, 0, tree->first_child(tree->ROOT));
+ sort(tagVector.begin(), tagVector.end(), myobject);
+ sort(tag2Vector.begin(), tag2Vector.end(), myobject);
+}
+
+void lex_index::print(){
+ printf("%i-vector: ", tag);
+ printVector(tagVector);
+ printf("%i-vector: ", tag2);
+ printVector(tag2Vector);
+}
+
+class lex_index_count : public lex_index {
+public:
+ vector<pair<int32_t,int32_t>> tcountVector;
+ vector<pair<int32_t,int32_t>> tcount2Vector;
+ void createCounts(xml_tree * tree);
+ void print();
+};
+
+void lex_index_count::createCounts(xml_tree * tree){
+ int k;
+ int i=0;
+ while((i+1)<tagVector.size())
+ {
+ k=1;
+ while(strcmp((const char*) tree->get_text(tagVector[i]),
+ (const char*) tree->get_text(tagVector[i+1]))==0){
+ k++;
+ tcountVector.push_back(make_pair(tagVector[i],1));
+ i++;
+ }
+ if(k>1) tcountVector[i-k+1]=make_pair((tcountVector[i-k+1]).first,k);
+ tcountVector.push_back(make_pair(tagVector[i],1));
+ i++;
+ }
+ if(i<tagVector.size())
+ tcountVector.push_back(make_pair(tagVector[i],1));
+ i=0;
+ while((i+1)<tag2Vector.size())
+ {
+ k=1;
+ while(strcmp((const char*) tree->get_text(tag2Vector[i]),
+ (const char*) tree->get_text(tag2Vector[i+1]))==0){
+ k++;
+ tcount2Vector.push_back(make_pair(tag2Vector[i],1));
+ i++;
+ }
+ if(k>1) tcount2Vector[i-k+1]=make_pair((tcount2Vector[i-k+1]).first,k);
+ tcount2Vector.push_back(make_pair(tag2Vector[i],1));
+ i++;
+ }
+ if(i<tag2Vector.size())
+ tcount2Vector.push_back(make_pair(tag2Vector[i],1));
+}
+
+void lex_index_count::print(){
+ printf("%i-vector: ", tag);
+ printPairVector(tcountVector);
+ printf("%i-vector: ", tag2);
+ printPairVector(tcount2Vector);
+}
+
+class VectorMergeJoin {
+public:
+ xml_tree * tree;
+ vector<int32_t> resultVector;
+ void mergeJoin(vector<int32_t> v1, vector<int32_t> v2);
+};
+
+void VectorMergeJoin::mergeJoin(vector<int32_t> v1, vector<int32_t> v2){
+ int i1=0;
+ int i2=0;
+ int k;
+ while((i1!=v1.size()) && (i2!=v2.size())){
+ k = strcmp((const char*) tree->get_text(v1[i1]),
+ (const char*) tree->get_text(v2[i2]));
+ if (k==0)
+ {
+ resultVector.push_back(v1[i1]);
+ i1++; //advance left
+ }
+ else if (k<0) i1++; //advance left
+ else i2++; //advance right
+ }
+}
+
+class VectorCountMergeJoin {
+public:
+ xml_tree * tree;
+ vector<pair<int32_t,int32_t>> resultVector;
+ void mergeJoin(vector<pair<int32_t,int32_t>> v1, vector<pair<int32_t,int32_t>> v2);
+};
+
+void VectorCountMergeJoin::mergeJoin(vector<pair<int32_t,int32_t>> v1, vector<pair<int32_t,int32_t>> v2){
+ int comp=0;
+ int i1=0;
+ int i2=0;
+ int k,j;
+ while((i1<v1.size()) && (i2<v2.size())){
+ k = strcmp((const char*) tree->get_text(v1[i1].first),
+ (const char*) tree->get_text(v2[i2].first));
+ comp++;
+ if (k==0)
+ {
+ for(j=0; j<v1[i1].second ; j++)
+ resultVector.push_back(v1[i1+j]);
+ i1=i1+j;
+ // i1++; //advance left
+ }
+ // else if (k<0) i1++; //advance left
+ else if (k<0) i1=i1+v1[i1].second; //advance left
+ // else i2++; //advance right
+ else i2=i2+v2[i2].second; //advance right
+
+ }
+ printf("Number of comparisons during MergeJoin: %i\n",comp);
+}
+