summaryrefslogtreecommitdiffstats
path: root/rasodmg/test/test_bmark_int1.cc
blob: dce13110738aa50922e3ef4b38cd632ccdc777ec (plain)
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
/*
* This file is part of rasdaman community.
*
* Rasdaman community 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.
*
* Rasdaman community 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 rasdaman community.  If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
 * SOURCE: test_bmark_int1.cc
 *
 * MODULE: rasodmg
 *
 * PURPOSE: benchmark interest tiling
 *
 * COMMENTS:
 *   This program is used to load the database with information
 *   for benchmarking interesting tiling
 *
*/

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include "rasodmg/ref.hh"
#include "rasodmg/transaction.hh" 
#include "rasodmg/database.hh"
#include "rasodmg/set.hh"
#include "rasodmg/marray.hh"
#include "rasodmg/odmgtypes.hh"
#include "rasodmg/storagelayout.hh"
#include "rasodmg/tiling.hh"
#include "rasodmg/dirtiling.hh"
#include "rasodmg/dirdecompose.hh"
#include "rasodmg/storagelayout.hh"
#include "raslib/oid.hh"
#include "RGBCube.hh"

#define S_32K               (32  * 1024L)
#define S_64K               (64  * 1024L)
#define S_128K              (128 * 1024L)
#define S_256K              (256 * 1024L)

#define TOTAL_CUBES         8
#define SIZE_X              120L  //  12L //
#define SIZE_Y              159L  //  16L //
#define SIZE_Z              119L  //  12L //       

char* server_name;
char* dbase_name;
char* colect_name;

void parse(int argc, char* argv[])
{
  if (argc != 4)
  {
    cout << "Usage: " << argv[0] << " [server name] [db name] [colection name]"
         << endl;

    exit(0);
  }

  server_name = argv[1];
  dbase_name  = argv[2];
  colect_name = argv[3];
}

void insert_datacube( )
{

  r_Ref< r_Set< r_Ref< r_Marray<r_ULong> > > >  cube_set;
  r_Minterval                                   domain[TOTAL_CUBES];
  r_Domain_Storage_Layout*                      dsl[TOTAL_CUBES];
  r_OId                                         oid[TOTAL_CUBES];
  
  for (int i = 0; i < TOTAL_CUBES; i++)
  {
    domain[i] = r_Minterval(3);
    domain[i] << r_Sinterval(0L, SIZE_X)
              << r_Sinterval(0L, SIZE_Y)
              << r_Sinterval(0L, SIZE_Z);
  }

  // For alligned tiling (Regular tiling)
  
  r_Minterval block_config(3);
  block_config << r_Sinterval(0L, SIZE_X)
               << r_Sinterval(0L, SIZE_Y)
               << r_Sinterval(0L, SIZE_Z);
  
  r_Aligned_Tiling* til_reg_32k = new r_Aligned_Tiling(block_config, S_32K);
  r_Aligned_Tiling* til_reg_64k = new r_Aligned_Tiling(block_config, S_64K);
  r_Aligned_Tiling* til_reg_128k = new r_Aligned_Tiling(block_config, S_128K);
  r_Aligned_Tiling* til_reg_256k = new r_Aligned_Tiling(block_config, S_256K);


  // For directional tiling

  r_Minterval interest1(3);
  interest1 << r_Sinterval(0L, SIZE_X)
            << r_Sinterval(80L, 120L)  // r_Sinterval(8L, 12L)  //
            << r_Sinterval(25L, 60L);  //  r_Sinterval(2L, 6L); //

  r_Minterval interest2(3);
  interest2 << r_Sinterval(0L, SIZE_X)
            << r_Sinterval(70L, 159L)  //  r_Sinterval(7L, 16L) // 
            << r_Sinterval(25L, 105L); //r_Sinterval(2L, 10L);  // 

  
  DList<r_Minterval> areas;
  areas += interest1;
  areas += interest2;

  r_Interest_Tiling* til_int_32k = 
     new r_Interest_Tiling(areas, r_Interest_Tiling::SUB_TILING, S_32K);
  r_Interest_Tiling* til_int_64k = 
     new r_Interest_Tiling(areas, r_Interest_Tiling::SUB_TILING, S_64K);
  r_Interest_Tiling* til_int_128k = 
     new r_Interest_Tiling(areas, r_Interest_Tiling::SUB_TILING, S_128K);
  r_Interest_Tiling* til_int_256k = 
     new r_Interest_Tiling(areas, r_Interest_Tiling::SUB_TILING, S_256K);
  
  // Domain storage layouts
  
  dsl[0] = new r_Domain_Storage_Layout(domain[0], til_reg_32k);
  dsl[1] = new r_Domain_Storage_Layout(domain[1], til_reg_64k);
  dsl[2] = new r_Domain_Storage_Layout(domain[2], til_reg_128k);
  dsl[3] = new r_Domain_Storage_Layout(domain[3], til_reg_256k);

  dsl[4] = new r_Domain_Storage_Layout(domain[4], til_int_32k);
  dsl[5] = new r_Domain_Storage_Layout(domain[5], til_int_64k);
  dsl[6] = new r_Domain_Storage_Layout(domain[6], til_int_128k);
  dsl[7] = new r_Domain_Storage_Layout(domain[7], til_int_256k);
  
     
  // Create cubes

  r_Database db;
  db.set_servername(server_name);
  
  for ( i=0; i< TOTAL_CUBES ; i++)
  {
    r_Transaction trans;

    r_Ref< r_Marray<r_ULong> > cube;
   
    try
    {
      cout << "Opening database " << dbase_name << " on " << server_name
           << "... " << flush;
    
      db.open(dbase_name);
      
      cout << "Ok" << endl;   
      cout << "Starting transaction... " << flush;
    
      trans.begin();

      cout << "Ok" << endl;
      cout << "Opening the set... " << flush;

      try
      {
        cube_set = db.lookup_object(colect_name);
      }
      catch (...)
      {
        cout << "*Failed*" << endl;      
        cout << "Creating the set... " << flush;
        
        cube_set =
            new(&db, "RGB_3D_Set") r_Set< r_Ref< r_Marray<RGBPixel> > >;

        db.set_object_name(*cube_set, colect_name);
      } 

      cout << "Ok" << endl;
      cout << "Creating the datacube... " << flush;
      r_Minterval newDomain( domain[i]);
      cube =
          new(&db, "RGB_3D_Cube") r_Marray<RGBPixel>(newDomain, dsl[i]);

      cube_set->insert_element(cube);

      cout << "Cube[" << i+1 << "]:  " << cube->get_oid() << endl;
      cout << "Spatial domain: " << cube->spatial_domain( ) <<endl;
      cout << "Storage Layout " << endl;
      dsl[i]->print_status( ); 
     
      cout << "*" << flush;
      cout << " ... Ok" << endl;
      cout << "Commiting transaction... " << flush;    

      trans.commit();
    
      cout << "Ok" << endl; 
      // cout << "Destroying cube... " <<flush;
      // cube.destroy( ); 
      cout << "Closing database... " << flush;
      db.close();
    }   
    catch (r_Error& e)
    {
      cout << e.what() << endl;
      exit(0);
    }
    catch (...)
    {
      cout << "Undefined error..." << endl;
      exit(0);
    }
  }
}

int main(int argc, char* argv[])
{
  parse(argc, argv);
  insert_datacube( );
  return 0;
}