、1274264 九、發明說明： 【發明所屬之技術領域】 其是法與系統，尤 式索引搜尋方法與系統。、[史㈣的非線上分散 【先前技術】 是者之間資料的分享與交換已經 隹ϊί木中式搜哥’另一種為分散式搜尋。圖1Α顯示了 一插 二ί的搜尋系統示細。當—個需要進行搜尋_#客^ 1〇4登入網路後，可向一集中搜尋飼服器、他 ^ 服器1〇2搜尋自身的資料庫後，便將結果回 = 雜下’針搜尋恤器1G2需要具有相 田=大的運异能力’以便滿足大量搜尋者的請求。 = ^機制在提供多數使用者之__交換與分享，其往财 ’而頻頸也狄在集中値器的效能，而 口 t iC沒有辦法搜尋其它客戶端裝置内的資料，都 此種架訊料及裝置’岐採用 夺圖1B顯示一種分散式的搜尋系統示意圖。在這種網路搜 3機制中’當搜尋客戶端祕裝置登人麟後，就必須開始找 哥/、他在線上的客户端裝置106，以便進行搜尋。這種搜尋機 制的缺點是f能應用在較小型的網路上，若被搜尋者的數量過 多二會^致資料間的傳輸缺乏效率。此外，此種搜尋機制只能 搜尋目前正在連線狀態的客戶端裝置106的資料。搜尋客戶端 4FASHION〇5〇〇3TW-發明專利申請書 5 .1274264 有它^ ίH e _(Qff_line)的客戶端裝置具 ，或等待 尋效能的供^^省儲存成本並提高搜 與非線上的歷史資料，將是===貝源，亚能搜尋線上 • 【發明内容】 線上存成本搜尋效能的非 5 求給第-鄰近客戶端。第—鄰一搜尋請 之客戶端回傳至搜尋者，s的層鄰近 系統本與工尋 -索引搜尋模組及一歷史資料庫：各二=具有 位置清科取得複數個客戶端之位置 4FASHION〇5〇〇3TW-發明專利申請書 1274264 第 -鄰ΐ:穴ΐ近客戶端。#搜尋客戶端發搜尋請求給 第第-鄰近客鳩由第-索引搜尋模組搜尋 傳搜哥模組鄰近下層之客戶端，其搜尋結果藉由回 當中二次鄰近之客户翻傳至搜尋者， 【實施方式】 《術語》 技蔽ί術μ用詞之定義如下’以便使熟此 明ιίΐ 雜本拥，飾這銳财麵視為本發 搜哥者：發出搜尋要求的網路上之實體。 被搜哥者：接收搜尋要求的網路上之實體。 的角m置：連接細路上的實體，依情況可作為搜尋者 的角色，也可以作為被搜尋者的角色。 兮資==線上f料：#系_#經被儲存的資料，在擁有 ^件ϋΐΐ端離線後，其它網路上的其它鄰近客戶端可以有 =線此即為非線上的= 客戶離線時，射ϋ之在所齡有的資料，當 連結ί^位^於指出相互 單’並不知道該清單是否上 4FASHION〇5〇〇3TW_發明專利申請書 7 1274264 端，確實的連線狀態。 線上亦稱為清單伺服器，用於儲存即時 上位置實體所發出的請求而提供線 或具有相嗎;的客戶1定網路 可透過鄰近或本相財位置清^用者仍 2:訊_構建連“=以 演算S輯連3所f，的資料，建立-個包含 上，透過該樣技術，大ίί/硬體料庫的搜尋技術 化的處理時間。 ^更體祕貝源，並從中獲得最佳 意義的方式，從中取得有 合搜ί 搜，搜尋符 搜要尋=時 ‘史有=該:戶於:存 杈組將來進行搜尋之用，其包括線上及非^^索引搜哥 、有限層次傳遞··為在資訊請求傳遞前、可 二人(由原始傳遞者發送資訊傳遞請求到且第^傳遞的層 7鄰近客戶端經過資訊處理並回傳給搜尋者端’第 遞。第-鄰近客戶端再傳遞給該第一鄰近客戶/二為-層傳 二端，第二鄰近客戶_結果透過第—鄰近客二：：鄰近客 者，為第二層之傳遞），若超出該層次範圍，到搜尋 3不會被再送出到其它鄰近的客戶端。傳遞凊求， 實際狀況需要而由系統管理者或使用者來設匕、限制’可視 4FASHION〇5〇〇3TW-發明專利申請書 1274264 夺圖2所示為依照本發明一實施例之非線上分散式索引搜 尋系統20。在本實施例中，系統2〇包括四個連線中的客戶端 裝置222、242、262、282，分別作為搜尋者與被搜尋者。客 戶端裝置222、242、262、282分別具有索引搜尋模組224、 244、264、284，以及歷史資料庫 226、246、266、286。在此 ，要注意的是，以客戶端裝置222為例，圖中以邏輯分離的方 f的描述索引搜尋模組224與歷史資料庫226係用於強調直間 各別^責的功能，而非用於限制本發明。索引搜尋模組224與 歷史資料庫226可被一同實施於客戶端裝置222之中，例如實 置222上所執行的軟體。或者，索引搜尋模組 —。芷史資料庫226也可以是分別獨立的網路上實體，例如 貫施為索；丨舰器或是歷史資解舰^，本發明並不對此設 匕熟此技藝者應能暸解到，圖2中以虛線係用於在邏 刀糸統20内的各不同元件僅係例示說明。除此之外， 不限定客戶端裝置所使_硬體架構，任何具有網路 ^七實r為置端 體每’地’歷史資料庫可以實施為獨立的 貝科庫値$ ’亦可實施為客戶端裝置中的—儲存器。 說明3接 ΐί明f發明的非線上分散式索引搜尋方法。因應 〇诸^思―個階段來說明此方法，包括名單取得、索引 ^或特疋的’而僅是描敘本發_ 發明的精神與特徵能更清楚地被暸解。爿以便使本 9 4FASHION〇5〇〇3TW-發明專利申請書 1274264 《名單取得》 名單ί得程序。分散式㈣搜尋方法的 飢中傳送客戶端裝置，首先在步驟 如位置資訊、裝置識別碼等其它資訊=服益j〇〇，例 300儲存有網路上客戶端裝置u、^ f飼服器 時，會由名單錬請統—20 ^ sit 單資料庫228中，以供將來二置二，存至其自身的歷史名 端裝置222也另—實施例中，客戶 ίίϊ =，方式取得，或直接由本身 貝枓庫228中取得。雖然客戶端梦 =』止丈名早 4 228 做為連線使用之參考。 貝竹彳一1 乃然1以手來 的儲名冗22!:以儲存於客戶端裝置222中所内建 ΤΑ 本 騁，计Η队、〜4也夺土 ΛΑ β 細衣置222為新加入的網路上實 裝置祀藝者當可知’客戶端 且亦各自擁有自身的歷史名\/=^搜尋者的角色，並 s 一端卿藉由所 4FASHION05003TW-發明專利申請書 1274264 置242、262、282。此處所述之連線，包括持續性 性的連線、以及藉由詢問/應答而確認被搜尋者的在 連線，本發明料關其型式。此外，步驟的ίί 個2並非用於限制本發明方法的實施順序，例如ί t Y ? S34的連線步驟，客戶端裝置222可同步發出連線1 求，亦可辦料，本㈣亦料鎌。 ®建線的明 索引ί立ί發3赌施射非線上分散式针搜尋方法的 路，，序。本發3·搜尋方法不僅可適祕小_區域網 資料if用於大型的網路’由於透過階層式的傳遞 《索引建立》 圖4 遠端。此 ^置之尋機制可增加資料傳輸的效♦。網路上所有客戶端 ^置之間的距離並不一定，有些較近而翻 Μ各戶'而 鄰近的定義可視實施的 同-個網域^ Jtd: 一個區域網路内的裝置、或是 只要是心…或疋同一個地理區域之内的裝置等等， ^収.以雜。在本實施 與非鄰近客戶踹^置^搜哥者Sr之間被區分為鄰近客戶端 一知。4近客戶端例如客戶端裝置242與262，而 括文件、圖像nHt使用。在本文中所述的資料，包 係舉客戶端裝ϋ Ί或二它的貧料内容。在本實施例中， 裝置亦可執彳^例，然熟此技藝者當可知，其它客戶綠 置222的資‘引建立操作。參照圖4，首先客戶端裝 用者修改圖像資料Γ則客^立的新文件檔案，或该 傳遞至索狀尋模組224。===以 4FA_N〇5〇〇3TW姻專利申請書 n 1274264 排序、建立_等等。_ 中錯存。在此需注“在是步驟二 =送至歷史資料庫2 r麵名與所在=置::=;= 外 ，處理與更新之 裝置如242、262、282^^ί匕f戶端裳置。其它客戶端 步更新，也可以在客戶3^=與;客戶端震置如本身同 也可以是_—段狀㈣行’ 示或是程式的設定，在特定的時間進行^新、使用者的指 在步驟S43中，客戶端裂置22 近的客戶端裝置，在此實施例中即為鄰 ，送資料讀賴客戶料置可叹種 傳$方 式’例如使用廣播的方式。客戶端裝置242盘種白 戶端裝置222較新資料後，便在步驟_中 者=驟泌中將索引處理後的資料個別 ^2 在步驟S46中，客戶端裝置262將客戶端裝置從所 的更新貧料，猶送至客彳端裝^ 282。錢上述_似流2 客戶端裝置282在步驟S47中將資料傳至索引搜尋模袓2科， 而索引搜尋模組284再於步驟S48將索引處理後的資料儲存至 歷史資料庫286。利用上述的架構，每一個客戶端只需要負責 4FASHION05003TW-發明專利申請書 12 1274264 將^新後的資料傳送至其鄰近客戶端，可減低 種限定階層式的傳遞方式，亦可使本翻應 :大㈣網路架構之下。此外，更新:#料被傳遞的階可 ，不同情況來做不_設定，每個 ^ 同的傳遞階層設定。 4相同或不 必需注意的是，索引搜尋模組224、244 =目=引處理方式與設定，或者亦可依據不同= =索引方式與設定。在另一實施例中’客戶端襄置222 二7二引ί尋模組224處理後的更新資料傳送給鄰、近客戶 ;此二端客=置=]可不需要再重覆進二i Γ田各戶置242、262、282的資料祐承說n士女 將更新後的資料傳送至客戶端裝置二’進 同考㈣決定’而在此範例中，客戶端裝置 的鄰近客戶端客戶端裝置242與262，且客戶端裝置262 ^神構裝置222與客戶端裝置282。在此示 它不同的連線架構iilY82獻技藝者當可知，更可有其 《進行搜尋》 搜尋Ξ序5 _上分散式*5丨搜尋方法的 索引搜ϊ模ΐ/2ί 户端裝置222發出搜尋的請求至 組224則對歷】ί料m戶隹端裝置242及泥。索引搜尋模 包括線上歷史= 行索引搜尋。歷史資料庫從中 將索引搜尋的結果“ 。气引搜尋模組224 種使用域理。搜尋本身賴史 =庫226 === 4FASHION〇5〇〇3TW-發明專利申請書 13 Ϊ274264 Ϊίί未在本地端被更新。因此，客 $別對索引搜尋模組244與施發出搜尋的指ς，以分別、= ===索:搜尋的結果回傳至客^ 2Μ ηΛ步 中將索引搜尋結果回傳至客戶端穿置 史資料t 果中亦包括線上歷史資料以及非線·^歷 發 端裝置㈣ 裝，歷史‘=:性 =尋端端尋 引搜尋指示至索引搜尋模组284 :以對歷 搜工284在步驟S57中將搜尋結果回^1,274264 IX. Description of the invention: [Technical field to which the invention pertains] It is a method and system, and a special index search method and system. [History (4) non-linear dispersion [Prior Art] The sharing and exchange of information between the two has been 隹ϊί木中式搜哥's another kind of decentralized search. Figure 1 shows a detailed search system for a plug-in. When you need to search _#客^1〇4 to log in to the network, you can search for the feed server and his server 1〇2 to search for your own database, then you will return the result = miscellaneous 'needle The search shirt 1G2 needs to have a phase difference = large transport capability 'to meet the requests of a large number of searchers. = ^ mechanism in the majority of users to provide __ exchange and sharing, its financial and "the frequency is also concentrated in the performance of the centralized device, and the port t iC has no way to search for data in other client devices, such a shelf The message and device ''shows a schematic diagram of a distributed search system using Figure 1B. In this network search mechanism, 'When searching for a client device, it is necessary to start looking for a client device 106 on his/her online to search. The disadvantage of this type of search mechanism is that f can be applied to smaller networks. If the number of searchers is too large, the transmission between data will be inefficient. In addition, such a search mechanism can only search for data of the client device 106 that is currently connected. Search client 4FASHION〇5〇〇3TW-invention patent application 5.1274264 has it ^ ίH e _ (Qff_line) client device, or wait for performance to save storage costs and improve search and non-line The historical data will be ===Beiyuan, Yaon search line. [Inventive content] The non-5 online cost search performance is requested to the first-neighbor client. The first-neighbor search seeks the client to pass back to the searcher, the layer adjacent system and the search-index search module and a historical database: each two = has the location of the Qingke to obtain the location of the plurality of clients 4FASHION 〇5〇〇3TW-Invention Patent Application 1274264 First-neighbor: ΐ ΐ near the client. #Search the client to send a search request to the first-adjacent customer. The first-index index search module searches for the client near the lower layer of the search system module, and the search result is forwarded to the searcher by returning to the second neighboring customer. , [Embodiment] "Terminology" Technology ί μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ μ . Searched by: The entity on the network that receives the search request. The angle m is set: the entity connected to the thin road, depending on the situation, can be used as the searcher's role, or as the searcher's role.兮资== Online f material: #系_# After the stored data, after having the offline, the other neighboring clients on other networks can have = line, which is non-line = when the customer is offline, The information of the age at the time of the shooting, when the link ί ^ bit ^ pointed out the mutual single 'do not know whether the list is on the 4FASHION 〇 5 〇〇 3TW_ invention patent application 7 1274264 end, the actual connection status. The online is also called the list server, which is used to store the request sent by the real-time location entity to provide the line or have the phase. The client 1 can set the network to be able to clear the user through the neighbor or the local money position. Build a "= to calculate the S series of 3, f, the data, build - including, through this technology, the processing time of the large ίί / hardware library search technology. ^ More secret shell source, and The way to get the best meaning from it, from the search for the search, the search for the search to find = time 'history = the: the household: the deposit group for future search, including online and non-^ index search Brother, finite-level delivery · Before the information request is delivered, the two can be sent by the original sender. The layer 7 is sent to the client and the message is sent back to the searcher. The first-neighboring client is then passed to the first neighboring client/the second-layered two-terminal, the second neighboring client_the result is transmitted through the first-neighboring guest two:: the neighboring guest, the second layer is transmitted) Beyond this level, search 3 will not be sent to other nearby customers. The terminal, the request, the actual situation needs to be set by the system administrator or the user, and the restriction 'visual 4FASHION〇5〇〇3TW-invention patent application 1274264 is shown in FIG. 2 according to an embodiment of the present invention. The non-linear distributed index search system 20. In this embodiment, the system 2 includes four client devices 222, 242, 262, and 282 in the connection, respectively, as a searcher and a searchee. The client device 222, 242, 262, and 282 have index search modules 224, 244, 264, and 284, respectively, and history databases 226, 246, 266, and 286. Here, it is noted that the client device 222 is taken as an example. The description of the logically separated party f indexing module 224 and the historical database 226 are used to emphasize the functions of the respective departments, and are not intended to limit the present invention. The index searching module 224 and the historical database 226 can be The software is executed in the client device 222, for example, the software executed on the real device 222. Alternatively, the index search module 226. The history database 226 can also be an independent entity on the network, for example, as a network; Ship or history The present invention is not to be understood by those skilled in the art, and the various components used in the logic cutter system 20 in FIG. 2 are merely illustrative. Qualified client device _ hardware architecture, any network with a network of seven real-time r-body history database can be implemented as a separate Bekoku 値 $ ' can also be implemented in the client device —Storage. Description 3 The method of non-linear decentralized index search invented by ΐ明明 f. This method is described in terms of various stages, including list acquisition, index ^ or special ', but only description The spirit and characteristics of the invention can be more clearly understood. In order to make the list of the 9F ASHION 〇 5 〇〇 3 TW - invention patent application 1274264 "list acquisition" list. Decentralized (4) search method of hunger transmission client device, first in the steps such as location information, device identification code and other information = service benefits, example 300 stored on the network client device u, ^ f feeding device , will be ordered by the list - 20 ^ sit single database 228 for the future two to two, stored in its own historical name device 222 is also another - in the embodiment, the customer ίίϊ =, the way to obtain, or directly Obtained by itself Bellow Library 228. Although the client dream = "stop the name of the early morning 4 228 as a reference for the use of the connection.贝竹彳一1 然然1 The name of the store is 22!: Stored in the client device 222 built in ΤΑ 骋 骋, Η 、 , ~ 4 also take the soil ΛΑ β 衣 222 222 new Those who join the network on the Internet can know the 'clients and each have their own historical name\/=^ the role of the searcher, and s one end with the 4FASHION05003TW-invention patent application 1274264 set 242, 262, 282. The connections described herein, including persistent connections, and the identification of the searched person's connections by inquiry/response, are contemplated by the present invention. In addition, the steps of the steps 2 are not used to limit the implementation sequence of the method of the present invention, for example, the connection step of the tt Y? S34, the client device 222 can simultaneously issue the connection 1 request, and can also handle the materials, the (4) is also expected sickle. The index of the line built by ί ί ί 3 赌 赌 施 施 施 施 施 施 施 非 非 非 非 非 非 非 非 非 非 非The 3rd search method is not only suitable for small _ regional network data if used for large-scale networks ‘because of the hierarchical transmission “index establishment” Figure 4 remote. This mechanism can increase the effectiveness of data transmission. The distance between all the clients on the network is not necessarily the same, some are close to each other's and the neighboring definition can be implemented by the same domain ^ Jtd: a device in a regional network, or as long as It is the heart...or the device within the same geographical area, etc. In this implementation, the non-neighboring client is separated from the neighboring client Sr into a neighboring client. 4 Near clients such as client devices 242 and 262, including files and images nHt are used. The information described in this article is based on the client's packaging or its poor content. In this embodiment, the device can also perform the example. However, those skilled in the art can know that the other client's green device 222 is used to establish the operation. Referring to Fig. 4, first, the client installer modifies the image file, and then the new file file is transferred to the cable search module 224. === Sort, create _, etc. with 4FA_N〇5〇〇3TW marriage patent application n 1274264. _ in the wrong. In this case, you need to note "In step 2 = send to the historical database 2 r face name and where = set::=;= outside, processing and updating devices such as 242, 262, 282 ^ ^ 匕 户 户 户 户Other client step updates can also be made in the client 3^= and the client can be set as the same as the _-segment (four) line or the program settings, at a specific time ^ new, user In step S43, the client cleaves the near client device, which in this embodiment is a neighbor, and sends the data to the client to send a sigh of $ mode, for example, using a broadcast method. After the 242 disk white terminal device 222 is newer, the index processed data is individually determined in step _ middle=sudden secretion. In step S46, the client device 262 removes the client device from the update. The information is sent to the client device 282. The above-mentioned _stream 2 client device 282 transfers the data to the index search module 2 in step S47, and the index search module 284 processes the index in step S48. The post data is stored in the historical database 286. With the above architecture, each client only needs to be responsible for 4FAS. HION05003TW-Invention Patent Application 12 1274264 Transfer the new data to its neighboring client, which can reduce the transfer mode of the limited hierarchical type, and also make the translation: under the large (four) network architecture. In addition, update: #料被级的级可,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, Alternatively, it may be based on different == indexing methods and settings. In another embodiment, the updated data processed by the client device 222 is transmitted to the neighboring and near-clients; Set =] can not be repeated into the second i Γ田 each household 242, 262, 282 information, the company said that the n s female will transfer the updated information to the client device two 'into the same test (four) decision 'here In the example, the client device is adjacent to the client client devices 242 and 262, and the client device 262 is configured with the client device 282. Here, the different connection architecture iilY82 is known to the skilled person, Can have its "search" search order 5 _ on the dispersion *5 索引 Search method index search ί 2 户 The client device 222 issues a search request to the group 224 for the calendar ί m m ί ί 。 。 。 。 。 。 。 。 。 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引 索引. The historical database will index the results of the search. The air intake search module 224 uses domain theory. Search itself Lai history = library 226 === 4FASHION 〇 5 〇〇 3TW - invention patent application 13 Ϊ 274264 Ϊ ίίί is not updated on the local side. Therefore, the customer searches for the index search module 244 and the index of the search, respectively, ====: the search result is sent back to the customer ^ 2Μ η step to pass the index search result back to the client to wear The historical data t also includes online historical data and non-line · ^ calendar originating device (4) installed, history '=: sex = search end search instruction to index search module 284: with the search 284 in the step S57 will search results back ^
ItZ^T 226 ； J 所、、工過的各戶知裝置262亦可選摆付土士膝屑次二y 、； 中:當"料_貝:有= 4FASHION05003TW-發明專利申|靑書; 14 .1274264 應用尋方式，使本發明有效率地 的戶端可叫射目同或不同 尋階層“例，戶端裝置數與搜 個客ί 尋階層的情形。此外，上述的任- 以ΚϊΐΊίί亦可，一個以上的索引搜尋模組及-個 理。 科庫’以配&不同的搜尋需求進行不同的索引處 色，中，客戶端裳置222係做為搜尋者的角 而1 t 1衣置42、262、282係做為被搜尋者的角色。然 πΊ #者當知，依照實施情形的不同，每個客戶端f置^ 可以在不同的時間點扮演搜尋者或是被搜尋者^戶色而。衣置都 《資料的保存》 3 述的名單舰器_、歷史名單資料庫228、或 ίΐΐΐί!^2^246、266、286,可視其儲存容量的大小， =定的大小時，系統可依照預定的刪除規^將= ，預定的刪除規則可包括各種不同的條丄ItZ^T 226 ; J, and the various household devices 262 that have been worked on can also be used to pay for the second paragraph of the shovel; y:; when: " material _ shell: there = 4FASHION05003TW- invention patent application | 14 .1274264 Applying the locating method, so that the efficient terminal of the present invention can be called the same or different homing class, for example, the number of the terminal device and the search for the user google. In addition, the above-mentioned ΚϊΐΊίί can also be more than one index search module and -. The Cocu's different indexing requirements for different search needs, and the client 222 is used as the searcher's corner. t 1 clothes set 42, 262, 282 as the role of the searched person. However, π Ί # know that, according to the implementation situation, each client f can be played at different time points as a searcher or The searcher ^ household color and the clothes are "storage of data" 3 list of the ship _, history list database 228, or ίΐΐΐί! ^ 2 ^ 246, 266, 286, depending on the size of its storage capacity, = set The size of the system, according to the predetermined deletion rules ^, the predetermined deletion rules can include a variety of different Shang
或疋先入先出法（First jn朽如〇ut，pip⑴】。盆6 的例如依照該資料所在的客戶端裝置是否能成‘ =除順序、或是在資料量累積—狀時間時S 租义H到一更新資料時進行刪除、或是上述方式的 、、且石，或疋其它類似的判斷方式。 1 本發明可利用低成本的分散式架構，提供效率佳的索引搜 4FASHION05003TW-發明專利申請書 】5 1274264 :並且其搜尋結果同時包括線上與非線上的資料， 。種不同目的之搜尋需求。 、 夕—亡述之實施例係用以描述本發明，然本發明技術仍可古％ ί之f?變化。因此，本發明並不限於以上特定實施例= 本赉明的申請專利範圍係欲包含所有此類修改與變化:: 【圖式簡單說明】Or first-in first-out method (First jn 〇 ut, pip (1)]. For example, according to whether the client device where the data is located can be in the order of '=, or when the amount of data is accumulated—the time is S. To delete a new data, or the above method, and stone, or other similar judgment methods. 1 The present invention can utilize a low-cost distributed architecture to provide an efficient index search 4FASHION05003TW-invention patent application 】 5 1274264 : and its search results include both online and non-line data, a variety of purposes for the search needs. The eve - the description of the embodiment is used to describe the present invention, but the technology of the present invention can still be used Therefore, the present invention is not limited to the above specific embodiments. The scope of the patent application is intended to cover all such modifications and changes as follows:
藉此達成 月包真正符合本發明之精神與範圍 圖1A顯示一種習知的集中式搜尋系統； 圖1B顯示一種習知的分散式搜尋系統； ,圖2為一種依照本發明實施例的非線上分散式索引 糸統不意圖； 、 圖3說明本發明實施例中非線上分散式索引搜尋方法 名單取得程序； 圖4說明本發明實施例中非線上分散式索引搜尋方法的 索引建立程序；以及Thus, it is achieved that the monthly package truly conforms to the spirit and scope of the present invention. FIG. 1A shows a conventional centralized search system; FIG. 1B shows a conventional distributed search system; FIG. 2 shows a non-line according to an embodiment of the present invention. The distributed indexing system is not intended to be; FIG. 3 illustrates a non-line distributed index searching method list obtaining program in the embodiment of the present invention; FIG. 4 illustrates an index establishing program of the non-line distributed index searching method in the embodiment of the present invention;
圖5說明本發明實施例中非線上分散式索引搜尋方法的 搜尋程序。 【主要元件符號說明】 102集中搜尋伺服器 川4搜尋客戶端 106客戶端裝置 222搜尋客戶端 224、244、264、284索引搜尋模組 226'246、266、286歷史資料庫 242、262、282客戶端裝置 300名單伺服器 4FASHION〇5〇03TW-發明專利申請書 16Figure 5 illustrates a search procedure for a non-line distributed index search method in an embodiment of the present invention. [Main component symbol description] 102 centralized search server Chuan 4 search client 106 client device 222 search client 224, 244, 264, 284 index search module 226 '246, 266, 286 history database 242, 262, 282 Client device 300 list server 4FASHION 〇 5 〇 03TW - invention patent application 16