DIRM : DIRM :A Model for Data Query Based on Dynamic Information Route Approach

HTML
DOWNLOAD

Μέγεθος: px

Εμφάνιση ξεκινά από τη σελίδα:

Download "DIRM : DIRM :A Model for Data Query Based on Dynamic Information Route Approach"

Ευτροπια Δράκος
8 χρόνια πριν
Προβολές:

1 37 1 ( ) Vol. 37 No JOURNAL OF SICHUAN UNIVERSITY ( ENGINEERING SCIENCE EDITION) Jan (2005) DIRM 1,2, 1, 1, 1 1 (1., , ), DIRM,,, DI2 RA IRH,, DIRA TP311 A DIRM A Model for Data Query Based on Dynamic Information Route Approach PENG Jing 1,2, TANG Chang2jie 1, HU Jian2jun 1, CHEN An2long 1, LI Chuan 1 (1. School of Computer,Sichuan Univ.,Chengdu ,China 2. Dept. of Sci. and Tech.,Chengdu Public Security Bureau,Chengdu ,China) Abstract A new model of DIRM (Dynamic Information Route Model) was proposed. The concept of information dynamic route based on information organization model was put forward,and the structural or the semi2structural data query was completed using the information route from host. Three algorithms Information Query Algorithm, DIRA( Dynamic Infor2 mation Route Algorithm), IRH Route Exchange Algorithm of the Boundary Area were proposed. The lemma of query e2 quivalent and lemma of limited steps was proved and the complexity of information query algorithm in different conditions was discussed. Key words dynamic information route model information retrieval DIRA structural data Internet Web,, 99 % 1), Yahoo Google Sohu,? HITS [1 2 ], 2), ( ) (04SG1640) (19732),,.. 3),

2 1, DIRM 109,, 3 Webservice SOAP XML, DIRA ( Dynamic, Information Route Algorithm) IRH, 1), [3 ], 3 2) [4 6 1) ], 3) [7 9 2) ], [8, ) ] , DIRM 1, 4 1) 2) 3) IRH 4), WEB 1),,,, (Dynamic Information Route Mod2 el,dirm), 2) DIRM, ( Information Route Host IRH ) 1 DIRM, IRH, IRH IRH 1 Fig. 1 Structure of information model

3 110 ( ) 37 g IRH IRH IRH g IRH (mirh) g, IRH 2) g IRH ( 1. 2 IRH 1 DIRM IRH,, IRH IRH 1) 4),, 2),, IRH g IRH, IRH 3,, (DIRA) g IRH, IRH IRH,, IRH IRH, IRH,, IRH,,, IRH ) internet intranet ) 3), 2 IRH 1 ( ) Q 4, Q = ( E, A, C, T),, E - Expression DIRM ( 2) A - Areas, C - Classes, T - Time 1, 1 E = ( X = a ) ( Y) ( Z LIKE k % ), A = {.,., C = {.,., T = ( , ) 2 ( ) IRH IRTR 6, IRTR = ( a, c, t, IP, Port, Cost), a - area 2 IRH IRH, c - class Fig. 2 Dynamic joining and leaving of the IRH or IRH area, t - time

4 1, DIRM 111 IP IRH IP, Port IRH Cost 2. 1 Q 2. 2 (DIRA), DIRA IRH, IRH,IRH IRH IRH IRTR IRH IRH IRH, IRTR, IRH, IRTR IP IRH, IRH IRH, IRH( ),, SearchOf2 Query, SearchOfIRT,DBQuery 1 Ip, Port, Q(e i, a i, c i, t i ) QueryResult SearchOfQuery( Ip,Port,Q(e i, a i,c i, t i ) ) { 1. IRTRs = SearchOfIRT(Q (e i, a i,c i, t i ) ) {, 2. For Each of IRTRs do 3. If Remote ( IRTRs[i ]. IP) Then 4. QueryResult = QueryResult + 5. RemoteCall SearchOfQuery ( IRTRs [ i ]. IP, IRTRs[i ]. Port, Q(e i, a i, c i, t i ) ) { IRH 6. Else 9. end For 10. Return QueryResult { 1) ReportStatus(mIRH,t,message) SearchOfIRT(Q(e i, a i, c i, t i ) ) { 1. CheckIsValid(Q(e i, a i, c i, t i ) ) {, 2. For each (a i, c i ) do, { a i, c i IRH( IRH) 3. Analyse (Q(e i ),Q(t i ) ) {, SQL 4. Execute (SqlQuery) {, 5. End For 6. MergeQueryResult { sql 7. Return Result { DBQuery R SQL XQL IRH, 3 3 (DIRA) 7. QueryResult = QueryResult + DBQuery(Q Fig. 3 An instance of DIRA (e i, a i, c i, t i ) ) {, 8. End If IRH 3 t, IRH 2) TriggerReportStatus(mIRH,message), message XML, < message type = change > < information > < type > < / type > < area > < / area > < begintime > < / begintime >

5 112 ( ) 37 < endtime > < / endtime > < / information > < / message > < message status = online/ > 3) Listener (message) Listener IRH,, IRH 2 IRH 2 IRH 2), t void 1. Repeat Listen(Message) { IRH, ( 3 3 t IRH, IRH ) 2. If Message. Type = CHANGE Then {,, IRH 3. ChangeLocalIRT(Message) { ) 4. For each LocalIRHs { IRH 5. BroardMessage ( IRHs[i ], Message) 6. Else If Message. Type = OFFline Then { 7. DeleteIRHs(Message) { IRH 8. DeleteIRTs(Message) { 9. For each LocalIRHs { IRH 10. BroardMessage ( IRHs[i ], Message) / / IRH 11. Else if (Message. Type = Online) AND not (Message. Host IN IRHs ) Then 12. ChangeLocalIRT(Message) { 13. AddIRHs(Message. Host) { IRH 14. For each LocalIRHs { IRH 9. BroardMessage (mirhs[ i ], Message) 15. BroardMessage ( IRHs[i ], Message) 16. SendMessage (Message. Host,AllIRT) { IRH 17. End If 18. Until Break ) IRH, IRH mirh, IRH IRH, IRH mirh 3) 4) IRH IRH ( mirh 3 IRH, t void 1. Repeat Listen(Message) { IRH, ( 3 3 t IRH, ) 2. If Message. Type = CHANGE Then {, 3. For each mirhs { IRH 4. BroardMessage (mirhs[ i ], Message) 5. Else If Message. Type = OFFline Then { 6. DeletemIRHs(Message) { IRH 7. DeletemIRTs(Message) { 8. For each mirhs { IRH { mirh

6 1, DIRM Else If (Message. Type = Online) AND not (Message. Host IN mirhs ) Then 11. ChangemIRT(Message) {,, q 12. AddmIRHs(Message. Host) { mirh 13. For each mirhs { mirh n, 14. BroardMessage (mirhs[ i ], Message) 15. SendMessage (Message. Host,AllIRT) { mirh O (log( n) ) 16. End If Π q ( e, a, c, t) Q 17. Until Break q ( c) IRH K, = K, T q q 3 1) IRH,, T q = T a + T b + T c =,, 6 q i + 6 t i + T c (1) i = 1 i =1 2), T a, T b,, T c q i ( i IRH = 1,, ) IRH t i ( i = 1,, ) 3, Π h Π k K, IRH i ( i = 1,2,, n) q, m i ( i = 1,, K ),, m i 2 3 d, d d q ( c) IRH K, log y ( n),, y Π k K, IRH m i O (log( n) ) (2) h k, T b q ( c) k, Π h IRH i ( T i = 1,2,, n) b = 6 t i = 6 ( 1 i + 2 i) (3) q K IRH, 1 i, 2 i 2 ( ) IRH i ( i = 1,2,, n), h 1 i O (log( x) ) (4) IRH i ( i = 1,2,, n) q, x, x IRH IRH, IRH, IRH, q 1 ( ) O ( n 3 log( n) ) IRH 1, IRH, q i IRH 1 ( ),, T a = IRH i ( i = 1,2,, n), q ( e, a, c, t) 6 q i K T c i = 1 Q, R i ( i = 1,2,, n), t i R i = R j ( i, j = 1,2,, n, i < > j),,, T b = 6 t i i =1 i = 1 B +, i = 1,

7 114 ( ) 37 IRH, IRH n, m i x < a 3 n + b,, a, b (4) 1 i O (log( n) ) (5) 2 i m i = n - 1, m i, O ( n) (3) (6) T b 2 i = c 3 m i + d (6) (1) O (log( n) ) 2 ( ) 2) IRH, IRH,, O ( n 2 ) ),, n IRH (2), m i ( i = 1,, K ), O (log( n) ),, 4 m i O ( n) IRH,, IRH 1 1 O ( K 3 n), K = n,, m i, c, d T b O ( n 2 ), (1) (2) m i O (log( n) ), 2 i O ( n 2 ) O (log( n) ), (3) T b 1, O ( K 3 log( n) ) K = n,, T b, O ( n 3 log( n) ), (1) 2, IRH O ( n 3 log( n) ),, IRH 1, IRH,, K = 1, T b O ( K 3 log( n) ), T b O (log( n) ),, 1) 4 4 Structure of experiment network Fig. 4 Mo2 8 dem P3, 8 IRH Windows 2000, Oracle 8i 1

8 1, DIRM 115,,, ( > 10 T) ( > 1000), 2, DIRM, P3/ 256 M,, C + + Builder 6. 0, Borland Client dataset, , , ( 20, ), 5 6,, x [1 ]Brin S, Page L. The anatomy of a large2scale hypertextual web search engine[a]. Proc. 7th World Wide Web Conf. (WWW 1995,31(3) Fig. 5 Comparing of route table number and elapsed time [5 ] Gravano L,Chang C, Garcia2Molina H,et al. STARTS Stanford Proposal for Internet Meta2Searching [ A ]. Proc. of the ACM2 6 Fig. 6 Comparing of query hop times and elapsed time 5, 98) [ C]. Brisbane, Australia, [2 ] Kleinberg J M. Authoritative sources in a hyperlinked environ2 ment[j ].Journal of ACM,1999, [3 ]Callan J. Distributed information retrieval. Croft W B. Advances in information retrieval[m]. Kluwer Academic Publishers, [4 ]Callan J,Croft W B,Broglio J. TREC and TIPSTER experiments with INQUERY[J ]. Information Processing and Management, SIGMOD Int l Conference on Management of Data[ C] [6 ]Callan J,Connell M. Query2based sampling of text databases[j ]. ACM Transactions on Information Systems,2001,19 (2) 97, [9 ]Craswell N,Bailey P,Hawking D. Server selection on the World log( n), n Wide Web[A ]. Proc. of the Fifth ACM Conference on Digital Libraries[ C]. ACM, , [10 ] Kirsch S T. Document retrieval over networks wherein ranking, and relevance scores are computed at the client for multiple, database documents[ P]. U. S. Patent 5,659,732., [11 ] Craswell N, Hawking D, Thistlewaite P. Merging Results from Isolated Search Engines [ A ]. Proc. of the Tenth Australasian, IRH Database Conf. [ C] ( ) 130. [7 ] Fuhr N. A decision2theoretic approach to database selection in networked IR [J ]. ACM Transactions on Information Systems, 1999,17(3) [8 ] Yuwono B,Lee D. Server ranking for distributed text retrieval systems on Internet[A ]. Proc of the Int Conf On Database Sys2 tems for Adv Applications[ C]

Σχετικά έγγραφα

Quick algorithm f or computing core attribute

24 5 Vol. 24 No. 5 Cont rol an d Decision 2009 5 May 2009 : 100120920 (2009) 0520738205 1a, 2, 1b (1. a., b., 239012 ; 2., 230039) :,,.,.,. : ; ; ; : TP181 : A Quick algorithm f or computing core attribute