Astronet Поиск по астрономическим сайтам English Russian
       
        Точная форма слов   О проекте   Сайты   Справка
Поиск по:www.sai.msu.su   - Поискать по всем серверам
На этой странице приведены все страницы сервера www.sai.msu.su ,которые мы индексируем. Показаны документы 11401 - 11420 из 11449.

В начало ] Пред. | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | След.

Упорядочить по: URL  |  дате изменения
11401. http://www.sai.msu.su/~megera/postgres/gist/papers/cs286.ps
Indexing for String Queries using Generalized Search Trees Jeff Foster jfoster@cs.berkeley.edu Megan Thomas mct@cs.berkeley.edu Abstract We present five index trees designed for sup­ porting string searches. ... A variant of B­Trees, called a Prefix­Suffix Tree, avoids this difficulty by severely restricting the form of queries. ... 6 Prefix­Suffix Trees A B­Tree [Com79] can efficiently support prefix queries on strings. ... Prefix­Suffix Trees succeed by severely restricting the form of queries. ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/cs286.ps -- 181.2 Кб -- 13.01.2001
Похожие документы

11402. http://www.sai.msu.su/~megera/postgres/gist/papers/icde98-search.pdf
... An intuitive (albeit non-GiST) example is that an integer ADT may be used to implement both B+ -tree keys or hash table keys (hash values), but the two index structures support different types of search predicates and operations. ... We describe the customization interface for each internal method in turn: · SEARCH is controlled by the CONSISTENT method, which returns true if a node entry predicate E . ... The original GiST can handle only single-predicate node entries. ... Summary of GiST methods. ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/icde98-search.pdf -- 131.1 Кб -- 13.01.2001
Похожие документы

11403. http://www.sai.msu.su/~megera/postgres/gist/papers/gist.ps
Generalized Search Trees for Database Systems Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer fhellers, naughtong@cs.wisc.edu, avi@cs.berkeley.edu June, 1995 Abstract This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensi­ ble set of queries and data types. ... Predicate Trees are used to generate hash keys. ... Non­leaf nodes contain (p; ptr) pairs, where p is a predicate used as a search key and ptr is a pointer to another tree node. ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/gist.ps -- 336.3 Кб -- 13.01.2001
Похожие документы

11404. http://www.sai.msu.su/~megera/postgres/gist/papers/PODS97.ps
On the Analysis of Indexing Schemes Joseph M. Hellerstein \Lambda Division of Computer Science UC Berkeley, Berkeley, CA 94720 jmh@cs.berkeley.edu Elias Koutsoupias y Department of Computer Science UCLA, Los Angeles, CA 90095 elias@cs.ucla.edu Christos H. Papadimitriou z Division of Computer Science UC Berkeley, Berkeley, CA 94720 christos@cs.berkeley.edu Abstract We consider the problem of indexing general database workloads (combinations of data sets and sets of poten­ tial queries). ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/PODS97.ps -- 154.7 Кб -- 13.01.2001
Похожие документы

11405. http://www.sai.msu.su/~megera/postgres/gist/code/7.1/README.gist
New version of gist.c for PostgreSQL 7.1 New feature: 1. Support of variable size keys - new algorithm of insertion to tree (GLI - gist layrered insertion). ... This (old) algorithm was not suitable for variable size keys and could be not effective ( walking up-down ) in case of multiple levels split Bug fixed: 1. fixed bug in gistPageAddItem - key values were written to disk uncompressed. ... NULLs handling - we keep NULLs in tree. ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/code/7.1/README.gist -- 2.4 Кб -- 10.01.2001
Похожие документы

11406. http://www.sai.msu.su/~megera/postgres/gist/papers/vldb95-gist.ps
Generalized Search Trees for Database Systems (Extended Abstract) Joseph M. Hellerstein University of Wisconsin, Madison jmh@cs.berkeley.edu Jeffrey F. Naughton \Lambda University of Wisconsin, Madison naughton@cs.wisc.edu Avi Pfeffer University of California, Berkeley avi@cs.berkeley.edu Abstract This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data types. ... Quad­Trees: A Data Structure For Retrieval On Composite Keys. ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/vldb95-gist.ps -- 203.1 Кб -- 04.01.2001
Похожие документы

11407. http://www.sai.msu.su/~megera/postgres/gist/papers/rd-tree.ps
THE RDнTREE: AN INDEX STRUCTURE FOR SETS Joseph M. Hellerstein University of Wisconsin, Madison Avi Pfeffer University of California, Berkeley Abstract The implementation of complex types in ObjectнRelational database systems requires the development of efficient access methods. ... We refer to the sets being indexed by the RDнTree as base sets, and the elements which comprise them as base elements. ... Leaf nodes in an RDнTree contain entries of the form (base set, bounding set). ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/rd-tree.ps -- 86.9 Кб -- 04.01.2001
Похожие документы

11408. http://www.sai.msu.su/~megera/postgres/gist/papers/hiperf-gist.ps
... The ap­ proach is is based on the generalized search tree, or GiST, which is a template index structure for ab­ stract data types that supports an extensible set of queries. ... The IDS/UDO imple­ mentation employs a newly designed GiST API that reduces the number of user de®ned function calls, which are typically expensive to execute, and at the same time makes GiST a more #exible data structure. ... 3.2 GiST Interface The functions of the GiST interface are summarized in Ta­ ble 1. ...
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/hiperf-gist.ps -- 452.6 Кб -- 04.01.2001
Похожие документы

11409. http://www.sai.msu.su/~megera/postgres/gist/papers/MingThesis.ps
Generalizing Database Access Methods by Ming Zhou A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathematics in Computer Science Waterloo, Ontario, Canada, 1999 c flMing Zhou 1999 I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/MingThesis.ps -- 390.8 Кб -- 04.01.2001
Похожие документы

11410. http://www.sai.msu.su/~megera/postgres/gist/papers/MA-97-02.ps
Reihe Informatik 2 / 1997 Index Structures for Databases Containing Data Items with Set­valued Attributes Sven Helmer 1 Index Structures for Databases Containing Data Items with Set­valued Attributes Sven Helmer September 29, 1999 Abstract We introduce two new hash­based index structures to index set­valued attributes. Both are able to support subset and superset queries. Analytical cost models for the new index structures as well as for the two existing index structures, sequential signature file and
[ Текст ]  Ссылки http://www.sai.msu.su/~megera/postgres/gist/papers/MA-97-02.ps -- 1395.4 Кб -- 04.01.2001
Похожие документы

11411. http://www.sai.msu.su/~megera/gimp/quintero/gimprc
... Therefore, the menu location # "Blur/Blur" specifies an item name of "Blur" in a submenu entitled # "Blur". ... It is convention to only use the `alt' and `shift' key modifiers for # plug-ins. ... The main application will not use the ` alt ' # or ` shift ' key modifiers. plug-in blur Blur / Blur Alt Key B Alt +B plug-in gauss Blur /Gaussian Blur Shift Alt Key B Shft+ Alt +B plug-in gauss_rle Blur /Gaussian Blur RLE plug-in gauss_recurse Blur /Gaussian ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/~megera/gimp/quintero/gimprc -- 7.9 Кб -- 05.09.2000
Похожие документы

11412. http://www.sai.msu.su/gcvs/gcvs/nl75/4870.ltx
\documentstyle[twoside]{article} \input ibvs2.sty \begin{document} \IBVShead{4870}{31 March 2000} \IBVStitle{The 75th Name-List of Variable Stars} \IBVSauth{Kazarovets, E.V.$^1$; Samus, N.N.$^1$; Durlevich, O.V.$^2$} \IBVSinst{Institute of Astronomy, Russian Academy of Sciences, 48, Pyatnitskaya Str., Moscow 109017, Russia\\ \indent [samus@sai.msu.ru, elena\_k@sai.msu.ru]} \IBVSinst{Sternberg Astronomical Institute, University of Moscow, 13, University Ave., Moscow 119899, Russia \\ \indent
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/gcvs/gcvs/nl75/4870.ltx -- 164.4 Кб -- 09.06.2000
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/groups/cluster/gcvs/gcvs/nl75/4870.ltx -- 164.4 Кб -- 09.06.2000
Похожие документы

11413. http://www.sai.msu.su/gcvs/gcvs/nl75/t2.txt
... V357 Hya = GSC |5455.00584 V357 Hya = IRAS |08510-1319 V357 Hya = Name |Tmz V84 V358 Hya = AN |349.1934 V358 Hya = BD |+ ... 00 3264 V2425 Oph = BV |167 V2425 Oph = CSV |7634 V2425 Oph = GSC |5066.00280 V2425 Oph = NSV |08513 V2426 Oph = IRAS |17168-2856 V2426 Oph = Name | Ter 0070 V2427 Oph = Name | Ter 0071 V2428 Oph = Name | Ter 0073 V2429 Oph = Name | Ter 0077 V2430 Oph = Name | Ter 0081 V2431 Oph = Name | Ter 0084 V2432 Oph = Name | ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/gcvs/gcvs/nl75/t2.txt -- 72.6 Кб -- 09.06.2000
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/groups/cluster/gcvs/gcvs/nl75/t2.txt -- 72.6 Кб -- 09.06.2000
Похожие документы

11414. Jenam 2000
.
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/jenam/ -- 1.8 Кб -- 25.05.2000
Похожие документы

11415. http://www.sai.msu.su/gcvs/gcvs/nl75/readme
THE 75th NAME-LIST OF VARIABLE STARS. ... The 75th Name-List consists of two tables. ... the literature, taken from positional catalogues, including USNO A1.0/A2.0 and GSC, or determined by the authors); the range of variability (sometimes the column Min gives, in parentheses, the amplitude of light variation; the symbol ( means that the star , in minimum light, becomes fainter, than the magnitude indicated); and the system of magnitudes used ( P are photographic ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/gcvs/gcvs/nl75/readme -- 7.8 Кб -- 19.04.2000
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/groups/cluster/gcvs/gcvs/nl75/readme -- 7.8 Кб -- 19.04.2000
Похожие документы

11416. пУЕООЕЕ тБЧОПДЕОУФЧЙЕ - 96 !!!
. пУЕООЕЕ тБЧОПДЕОУФЧЙЕ - 96 . чЕДХЭЙК РТБЪДОЙЛБ - аТБ рБИПНПЧ. чЩУФХРБЕФ 5 ЛХТУ (ЖПФП1). чЩУФХРБЕФ 5 ЛХТУ (ЖПФП2). чТХЮЕОЙЕ РТЙЪБ ЪБ МХЮЫХА ЦЕОУЛХА ТПМШ. лМСФЧБ БУФТПОПНБ. "зТБОЙФ ОБХЛЙ" . жПФП: бОДТЕС вПВЛПЧБ.
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/~aleks/OsenRavn/osennkoi.htm -- 2.6 Кб -- 15.03.2000
Похожие документы

11417. http://www.sai.msu.su/~er/XF86Config
... Files section. ... RgbPath "/usr/X11R6/lib/X11/rgb" # Multiple FontPath entries are allowed (which are concatenated together), # as well as specifying multiple comma-separated entries in one FontPath # command (or a combination of both methods) # # If you don't have a floating point coprocessor and emacs, Mosaic or other # programs take long to start up, try moving the Type1 and Speedo directory # to the end of this list (or comment them out). ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/~er/XF86Config -- 14.3 Кб -- 15.01.2000
Похожие документы

11418. http://www.sai.msu.su/~megera/postgres/pg-bench.pl
usr/local/bin/perl use strict; use DBI ; use DBD::Pg; use Benchmark; # Change this my $ DSN = ' DBI :Pg:dbname=test'; my $ TABLE = 'bench'; my($i); sub TimeMe ($$$$) { my($startMsg, $endMsg, $code, $count) = @_; printf( \n%s\n , $startMsg); my($t1 ... Testing empty loop speed ... , %d iterations in %.1f cpu+sys seconds (%d per sec) , sub { }, 100000); my($ dbh ); TimeMe( Testing connect / ... sth->rows(); while ($sth->fetch()) { } }, 100); $sth->finish; $dbh->disconnect(); exit; ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/~megera/postgres/pg-bench.pl -- 4.5 Кб -- 31.07.1999
Похожие документы

11419. http://www.sai.msu.su/~megera/postgres/mkjoindata.pl
usr/local/bin/perl -w # Crash Postgres with many joins # Oleg Bartunov, 1999 use strict; $| = 1; my $ njoins = undef; my $ nrows = undef; my @nitems = (); my $ option = undef; my $vacuum = 0; my $ explain = 0; my $ geqo = 0; my $ bad_option = ''; while ( @ARGV ) { $ option = shift @ARGV; if ( defined ($ option ) ) { if ( $ option =~ /^--with-vacuum$/ ) { $vacuum = 1; } elsif ($ option =~ /^-- explain $/ ) { $ ... nrows,'x$ntables . ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/~megera/postgres/mkjoindata.pl -- 3.5 Кб -- 26.05.1999
Похожие документы

11420. http://www.sai.msu.su/groups/cluster/zasov/non-ads.cat
PGC021624 Mrk78 1991AISAO.. ... 144 19981203 O E 1 V 123 019 020 PGC021624 Mrk78 1991AISAO.. ... 144 19981203 O E 1 V 16 019 020 018 PGC031257 Mrk34 1991AISAO.. ... 132 19981203 O E 1 V 169 018 019 020 025 026 UGC03547 Mrk6 1991AISAO.. ... 114 19981203 O E 1 V 16 018 019 020 UGC03973 Mrk79 1991AISAO.. ... 104 19981203 O E 2 P 020 UGC01214 Mrk573 1991AISAO.. ... 88 19981203 O E 1 V 10 018 019 020 UGC01214 Mrk573 1991AISAO.. ... 88 19981203 O E 1 V 110 018 019 020 UGC01214 Mrk573 1991AISAO.. ...
[ Сохраненная копия ]  Ссылки http://www.sai.msu.su/groups/cluster/zasov/non-ads.cat -- 9.4 Кб -- 25.05.1999
Похожие документы

В начало ] Пред. | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | След.

Rambler's Top100 RFBR Яндекс цитирования