CQParallel Class Reference

#include <CQParallel.h>

Inheritance diagram for CQParallel:

List of all members.

Public Member Functions
	~CQParallel ()
	CQParallel (CAccessorAdminCollection &inAccessorAdminCollection, CAlgorithm &inAlgorithm)
virtual CXMLElement *	query (const CXMLElement &inQuery, int inNumberOfInterestingImages, double inDifferenceToBest)
virtual CIDRelevanceLevelPairList *	fastQuery (const CXMLElement &inQuery, int inNumberOfInterestingImages, double inDifferenceToBest)
virtual CXMLElement *	getRandomImages (int inNumberOfInterestingImages) const
virtual list< TID > *	getAllIDs () const
virtual list< string > *	getAllURLs () const
virtual list< pair< TID, string > > *	getAllIDURLPairs () const
virtual bool	setAlgorithm (CAlgorithm &inAlgorithm)
void	finishInit ()
Protected Member Functions
virtual void	init ()
Private Attributes
CAccessorAdminCollection &	mAccessorAdminCollection
lCLocalAccessorMap	mAccessors
Classes
class	lCLocalAccessor
class	lCLocalAccessorMap

---

Detailed Description

FIXME: The name WRONGLY suggests that this actually does parallel processing. It should be relatively quick to add, it is intendend, but it is not yet done.

This is going to be one of our main building blocks. It is a structure which contains a couple of CQuery structures, hands a query through to them, and then unifies the result. In fact this is the center of all this query tree business.

Probably we will put another layer into the class tree: The CQTreeNode, but let's first start.

Important: The basic assumption here is, that all children operate on the same collections. If this is not the case we have to be more careful, and most of all: we have to operate using URLs.

: Wolfgang Müller

Definition at line 94 of file CQParallel.h.

---

Constructor & Destructor Documentation

CQParallel::~CQParallel

(

)

we need to unregister the accessors used

destructor: at present empty

Definition at line 77 of file CQParallel.cc.

                       {

  cout << "destroying this "
       << __FILE__
       << __LINE__
       << flush
       << endl;

  //i thought i will need this, but at present I do not have this impression
  //it does not hurt, so we leave it in
};

CQParallel::CQParallel	(	CAccessorAdminCollection &	inAccessorAdminCollection,
		CAlgorithm &	inAlgorithm
	)

In fact, what we are doing here is to get ourselves an accessor ACURL2FTS to do a proper fastQuery

constructor see CQuery

Definition at line 61 of file CQParallel.cc.

00062                                             :
00063   mAccessorAdminCollection(inAccessorAdminCollection)
00064 {
00065   
00066 
00067   // nothing we could do here at present...
00068  
00069 
00070 };
    

---

Member Function Documentation

void CQParallel::init

(

)

[protected, virtual]

Initializer, used by both construcors

FIXME: The name WRONGLY suggests that this actually does parallel processing. It should be relatively quick to add, it is intendend, but it is not yet done.

This is going to be one of our main building blocks. It is a structure which contains a couple of CQuery structures, hands a query through to them, and then unifies the result. In fact this is the center of all this query tree business.

Probably we will put another layer into the class tree: The CQTreeNode, but let's first start.

Important: The basic assumption here is, that all children operate on the same collections. If this is not the case we have to be more careful, and most of all: we have to operate using URLs.

Initializer, used by both construcors

Implements CQuery.

Definition at line 52 of file CQParallel.cc.

                     {
  //we assume that all the children have been initialised.
  //so there is nothing to do here
};

CXMLElement * CQParallel::query	(	const CXMLElement &	inQuery,
		int	inNumberOfInterestingImages,
		double	inDifferenceToBest
	)			[virtual]

calls fastQuery for every child, merges the results and translates them back into URLs difficulty: take into account that each child might operate on a different collection.

calls fastQuery for every child, merges the results and translates them back into URLs

Definition at line 94 of file CQParallel.cc.

References mAccessors.

                                         {

  //
  double lWeightNormaliser=0;

  //
  cout << endl
       << "I made it till here " 
       << endl
       << flush;

  CXMLElement* lReturnValue=new CXMLElement();

  //
  assert(lReturnValue);

  //this will be the receptacle of the final result
  map<string,double> lURLToRelevanceLevel;
  

  //for all collections
  for(lCLocalAccessorMap::iterator i=mAccessors.begin();
      i!=mAccessors.end();
      i++){
    lWeightNormaliser+=i->second.mWeightedSum;
    i->second.mUnifiedResults=new map<TID,double>();


    //for all query structures using each collection
    for(list<lCChildren::iterator>::iterator j=i->second.mUsedBy.begin();
  j!=i->second.mUsedBy.end();
  j++){


      CIDRelevanceLevelPairList* ltempResultList=
  (*j)->mQuery->fastQuery(inQuery,
        inNumberOfInterestingImages,
        inDifferenceToBest);


      //
      CSelfDestroyPointer<CIDRelevanceLevelPairList> lResultList=
  ltempResultList;
      
      
      cout << endl
     << "Subquery: current result size "
     << lResultList->size()
     << endl;

      if(lResultList){
  for(CIDRelevanceLevelPairList::iterator k=lResultList->begin();
      k!=lResultList->end();
      k++){
    map<TID,double>::iterator lFound=
      (i->second.mUnifiedResults)->find(k->getID());

    if(lFound==i->second.mUnifiedResults->end()){
      i->second.mUnifiedResults
        ->insert(make_pair(k->getID(),
         k->getRelevanceLevel()));
    }else{
      i->second.mUnifiedResults
        ->insert(make_pair(k->getID(),
         k->getRelevanceLevel()
         +lFound->second * (*j)->mWeight));

    }
  }
      }
    }

    //now we have unified lists of IDs which belong
    //to one collection
    //Now turn them into URLs and sum them all up
    //note that it is not guaranteed that 
    //the maps we unite are sorted the same way, so
    //we do it again with maps.
    for(map<TID,double>::const_iterator j=i->second.mUnifiedResults->begin();
  j!=i->second.mUnifiedResults->end();
  j++){
      assert((i->second).mAccessor);
      for(map<TID,double>::const_iterator 
      k=(i->second).mUnifiedResults->begin();
    k!=(i->second).mUnifiedResults->end();
    k++){
  string lURL=i->second.mAccessor->IDToURL(k->first);

  map<string,double>::iterator lFound=
    lURLToRelevanceLevel.find(lURL);
  if(lFound!=lURLToRelevanceLevel.end()){
    lURLToRelevanceLevel[lURL]+=k->second;
  }else{
    lURLToRelevanceLevel[lURL] =k->second;
  }
      }
    }
    i->second.mUnifiedResults=0;
  }
  //
  //
  //
  for(map<string,double>::iterator i=lURLToRelevanceLevel.begin();
      i!=lURLToRelevanceLevel.end();
      i++){
    lReturnValue->push_back(CRelevanceLevel(i->first,
              i->second/lWeightNormaliser));
    
  }
  //this is quite ugly
  //should be one sort with the right op
  lReturnValue->sort();
  lReturnValue->reverse();
  return lReturnValue;
};

CIDRelevanceLevelPairList * CQParallel::fastQuery	(	const CXMLElement &	inQuery,
		int	inNumberOfInterestingImages,
		double	inDifferenceToBest
	)			[virtual]

FIXME: useless in current scenario.

Generally using IDs instead of URLs (for keeping communication overhead low, when doing things like CORBA).

in this case we simply hand things through. this might be some kind of "take it and translate it" thing. however, at present we save the work.

using IDs instead of CQParallel::URLs (for keeping communication overhead low, when doing things like CORBA).

Implements CQuery.

Definition at line 218 of file CQParallel.cc.

                                       {
  assert(0);
};

CXMLElement * CQParallel::getRandomImages

(

int

inNumberOfInterestingImages

)

const [virtual]

get some random images

Reimplemented from CQuery.

Definition at line 229 of file CQParallel.cc.

{};

virtual list<TID>* CQParallel::getAllIDs

(

)

const [virtual]

get the IDs of all images (handed through to accessor)

Reimplemented from CQuery.

virtual list<string>* CQParallel::getAllURLs

(

)

const [virtual]

get the IDs of all images (handed through to accessor)

virtual list<pair<TID,string> >* CQParallel::getAllIDURLPairs

(

)

const [virtual]

get the IDs of all images (handed through to accessor)

bool CQParallel::setAlgorithm

(

CAlgorithm &

inAlgorithm

)

[virtual]

set the Algorithm. same scheme as in setCollection

Reimplemented from CQuery.

Definition at line 236 of file CQParallel.cc.

{};

void CQParallel::finishInit

(

)

[virtual]

it might be necessary to wait until all the children are added before ending the initialisation phase.

This function is called by CAlgorithm.

What we are doing here is to find out the necessary accessor information for each child, and construct an accessor for it.

it might be necessary to wait until all the children are added before ending the initialisation phase.

This function is called by CAlgorithm.

Reimplemented from CQuery.

Definition at line 245 of file CQParallel.cc.

References CAccessorAdminCollection::getProxy(), mAccessorAdminCollection, mAccessors, and CQuery::mChildren.

                           {
  cout << endl
       << "Finish init in CQParallel, size of mChildren"
       << mChildren.size()
       << endl;
  
  for(lCChildren::iterator i=mChildren.begin();
      i!=mChildren.end();
      i++){
    string lCollection=i->mQuery->getAlgorithm().getCollectionID();

    //FIXME fails if not all the parents say which collections 
    //unfixable. need to catch this case somewhere
    //
    //they contain included in this instruction is:
    //make a new item if there is already one
    lCLocalAccessorMap::iterator lFound=mAccessors.find(lCollection);

    if(lFound==mAccessors.end()){
      mAccessors.insert(make_pair(lCollection,
          lCLocalAccessor()));
      //do i need this: look up in specs
      lFound=mAccessors.find(lCollection);
    }
    //
    lFound->second.mUsedBy.push_back(i);
    //FIXME: actually make the accessor.
    //relies on mAccessor initially being 0
    if(!lFound->second.mAccessor){
      //
      CAccessorAdmin* lProxy=&(mAccessorAdminCollection
             .getProxy(i->mQuery->getAlgorithm()
           .getCollectionID()));
      
      lFound->second.mAccessor=lProxy->openURL2FTS();
      lFound->second.mAccessorAdmin=lProxy;
      
    }

    //this enables you to put relative weight on algorithms
    lFound->second.mWeightedSum+=i->mWeight;
  }
  cout << "finishInitFinished inCQParallel"
       << endl
       << endl;
};

---

Member Data Documentation

CAccessorAdminCollection& CQParallel::mAccessorAdminCollection [private]

We need this because we cannot use this just when constructing, but we have to use it in finishInit

Reimplemented from CQuery.

Definition at line 99 of file CQParallel.h.

Referenced by finishInit().

lCLocalAccessorMap CQParallel::mAccessors [private]

do not confuse with mAccessor. This is the accessor list we talked about before

Definition at line 143 of file CQParallel.h.

Referenced by finishInit(), and query().

---

The documentation for this class was generated from the following files:

• gift/libMRML/include/CQParallel.h
• gift/libMRML/cc/CQParallel.cc