Indexing of the space data in the CSDB Microsoft SQL Server 2000; Bulletin of the Tomsk Polytechnic University; Vol. 309, № 4

Bibliografiset tiedot
Parent link:Bulletin of the Tomsk Polytechnic University/ Tomsk Polytechnic University (TPU).— , 2006-2007
Vol. 309, № 4.— 2006.— [P. 145-149]
Päätekijä: Shestakov N. A.
Yhteenveto:Заглавие с титульного листа
Электронная версия печатной публикации
2 schemes of space indexing are realized in environment of CSDB Microsoft SQL Server 2000. The experimental research of the realized methods for window inquiries is carried out. Comparison of the realized methods with available in the standard means of indexing being in the given CSDB has been carried out. To find the quadrant splitting in methods Z-and XZ-indexing the heuristic algorithm which gives a smaller error of approximation in comparison with standard algorithm is proposed.
Kieli:englanti
Julkaistu: 2006
Sarja:Technical sciences
Aiheet:
Linkit:http://www.lib.tpu.ru/fulltext/v/Bulletin_TPU/2006/v309eng/i4/36.pdf
Aineistotyyppi: Elektroninen Kirjan osa
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=180079

MARC

LEADER 00000nla2a2200000 4500
001 180079
005 20231031170634.0
035 |a (RuTPU)RU\TPU\book\195214 
035 |a RU\TPU\book\195210 
090 |a 180079 
100 |a 20100506d2006 k y0rusy50 ca 
101 1 |a eng  |c rus 
102 |a RU 
135 |a drnn ---uucaa 
200 1 |a Indexing of the space data in the CSDB Microsoft SQL Server 2000  |b Electronic resource  |f N. A. Shestakov 
203 |a Text  |c electronic 
215 |a 1 файл (221 Кб) 
225 1 |a Technical sciences 
230 |a Электронные текстовые данные (1 файл : 221 Кб) 
300 |a Заглавие с титульного листа 
300 |a Электронная версия печатной публикации 
320 |a [Bibliography: p. 149 (9 titles)] 
330 |a 2 schemes of space indexing are realized in environment of CSDB Microsoft SQL Server 2000. The experimental research of the realized methods for window inquiries is carried out. Comparison of the realized methods with available in the standard means of indexing being in the given CSDB has been carried out. To find the quadrant splitting in methods Z-and XZ-indexing the heuristic algorithm which gives a smaller error of approximation in comparison with standard algorithm is proposed. 
337 |a Adobe Reader 
461 1 |0 (RuTPU)RU\TPU\book\169973  |t Bulletin of the Tomsk Polytechnic University  |f Tomsk Polytechnic University (TPU)  |d 2006-2007 
463 1 |0 (RuTPU)RU\TPU\book\189726  |t Vol. 309, № 4  |v [P. 145-149]  |d 2006  |p 163 p. 
610 1 |a indexing 
610 1 |a space data 
610 1 |a CSDB 
610 1 |a experimental researches 
610 1 |a window inquiries 
610 1 |a comparison 
610 1 |a standard means 
610 1 |a heuristic algorithm 
610 1 |a approximation 
610 1 |a электронный ресурс 
610 1 |a труды учёных ТПУ 
675 |a 004.657  |v 3 
700 1 |a Shestakov  |b N. A. 
801 1 |a RU  |b 63413507  |c 20090623  |g PSBO 
801 2 |a RU  |b 63413507  |c 20110331  |g PSBO 
856 4 |u http://www.lib.tpu.ru/fulltext/v/Bulletin_TPU/2006/v309eng/i4/36.pdf 
942 |c CF