發信人: mycat (cat), 信區: DataMining
標  題: Re: 幾個簡單的問題！
發信站: 南京大學小百合站 (Sat Jun 29 09:50:54 2002), 站內信件

但是什么才是Very Large Data Bases呢？是以記錄的條數來確定？還
是根據什么其它的標準？不好意思我只是才研究這方面?？赡軉柕糜?點可笑

【 在 fervvac (高遠) 的大作中提到: 】
: You seem to already have that paper ya, just read it carefully, it is at least
: an VLDB paper, :)
: The definition of metric space and similarity search should already been 
: defined in the paper. Basically, you can imagine a metric space being a
: n-D space, where there is no (total) order for any dimension. For example,
: color. But there is a mechanism to define similarity measure.
: 【 在 mycat (cat) 的大作中提到: 】
: : 有幾個單詞,句子不知如何翻譯：
: : metric space;
: : multi-dimensional access methods ,such as R-tree,have been considered to ind
: : ex such data.
: : access method;
: : indexing a metric space means to provide an efficient support for answering 
: : similarity queries
: : 還有，有誰知道m-tree嗎，能簡單介紹一下它的機制嘛？它和R-tree類似！


--
※ 來源:．南京大學小百合站 bbs.nju.edu.cn．[FROM: 61.241.0.65]