CN101178733A - Index, search, storage and display control information systems for associated data - Google Patents
Index, search, storage and display control information systems for associated data Download PDFInfo
- Publication number
- CN101178733A CN101178733A CNA200710192532XA CN200710192532A CN101178733A CN 101178733 A CN101178733 A CN 101178733A CN A200710192532X A CNA200710192532X A CN A200710192532XA CN 200710192532 A CN200710192532 A CN 200710192532A CN 101178733 A CN101178733 A CN 101178733A
- Authority
- CN
- China
- Prior art keywords
- data block
- data
- information
- positional information
- piece
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9558—Details of hyperlinks; Management of linked annotations
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses an information system relating to the index, searches, storage and control displaying of the related data. The invention index system at least comprises two data blocks with relating relationship, each data block consists of position information blocks and content information blocks, the content information blocks are the other data besides the position information blocks in the data blocks, the position information blocks record the position information of the other data blocks related to the data blocks and generate index data according to the prescribed steps; the index method is that: the method generates data block aggregation according to the information input by the users, uses the method of generating key words by corresponding index system to generate index words, and then proceeds index to the index words and displays the result. The invention proceeds the displaying control based on the data blocks and the geometrical relationships in the existing displaying district. The invention is utilized to directly index the relating information in the related data, so as to conveniently realize the concurrent processing of multi-users and commonly share the information which is managed.
Description
Technical field
The present invention relates to areas of information technology, particularly a kind of storage, index with incidence relation data, retrieve and present the infosystem of control.
Background technology
In current information society, along with popularizing gradually of infotech, infosystem has obtained widespread use.Along with the data that accumulate in the infosystem are more and more, people have depended on gradually by retrieval and have come acquired information from infosystem fast.People during retrieving information, usually can obtain a lot of results in infosystem, a large amount of uncorrelated content that wherein is mingled with has reduced the efficient that people obtain information, have also reduced the effective rate of utilization of system resource simultaneously.It is particularly outstanding that this phenomenon seems in the retrieval of magnanimity information system; when for example in existing search engine, retrieving certain information; usually can obtain bulk information; therefore; people have to the large result that search engine returns is differentiated one by one; to determine whether being needed content, this has caused low information acquisition efficiency.Result for retrieval is inaccurate, retrieval quality is not high then is ubiquitous problem in the present magnanimity information system.
At present, based on the text retrieval system of keyword matching technique when setting up index, usually earlier with the keyword that occurs in the text locating information generation index data base with keyword place text, the search interface input term that provides with infosystem is retrieved then, system carries out matched and searched to the term that the user provided in index data base, obtain the locating information of term place text, show summary or full text at last by the determined text of this locating information.On the basis of keyword matching technique, also can realize Boolean retrieval.
For indexing for the information that exists in the text, directory system needs text is done semantic analysis, and the processing of the ambiguity of text is the process that can't walk around in the text semantic analysis.Ambiguity is meant the phenomenon that can represent multiple meaning with a kind of linguistic form, and ambiguity can take place in a plurality of aspects such as vocabulary, sentence structure, semanteme, pragmatic.The main cause that forms ambiguity is that the language construction with the text mode tissue of one-dimensional linear is limited, semantic then be infinite, being close to the infinite meaning with limited structure representation can inevitably cause a language construction to express the one-to-many phenomenon of multiple semantic content, this is the root that produces ambiguity, and also is the biggest obstacle of text semantic analytical technology.For example, one-to-many phenomenon such as word order ambiguity that speech causes corresponding to the polysemy phenomenon of a plurality of implications, different word order.Information organization mode based on the one-dimensional linear text is to cause data handling system to be difficult to solve the basic reason of its ambiguity problem, therefore, under the background that quantity of information sharply increases in present infosystem, seek a kind of information organization method that can be easy to reduce semantic ambiguity and just become very urgent.
From term and the document relational angle between the two, be a kind of retrieval in essence to the appearance relation of term in document based on the retrieval of keyword matching technique.Can find thus, retrieval based on the keyword matching technique exists not enough on following two links: first link is when setting up index, except the information whether keyword occurs, do not preserve the out of Memory that exists in the document in the index data in text.For example, be present in cause-effect relationship in the text, time order and function order, spatial relationship etc.This is actually in the index process has just lost the information that comprises in the text, has caused loss of learning, thereby has made index data be not enough to the information in the complete reflection text.Second link is when retrieval, what described by Boolean retrieval condition that term constituted only is the Conditions of term in text, therefore search condition lacks the complicated semantic ability in the text of describing, and this makes the description searched targets that the user can't be clear and definite, detailed.The deficiency that exists in above-mentioned two links has directly caused based on the retrieval of simple keyword matching technique and has looked into result inaccurate, that retrieval quality is not high.
Be that the significant disadvantages that the internet, applications of prevailing model exists is at present with web server one browser, people can only receive information passively by browser in most cases, and be difficult to flexibly the information of being browsed processed processing (as mark, increase, modification etc.) and the information that the back increased is handled in processing carry out sharing flexibly, the one way propagation mode of this information mainly is that information organization mode, access mode and the display mode by hypertext determined.Though there are the people that make that dimension visitor (wiki) such application can be online that information in the browser is done some simple processing and processing, and to the information after processing share, but this still from mutual, easily information is reprocessed and the target of sharing processing back gained information flexibly differs greatly.
Be compared to mode with one-dimensional linear text representation semanteme, use figure or picture expression semanteme then more directly perceived, vivid, this directly perceived, the semantic mode of figurative expression can be traced to the picture writing and the pictograph at literature record initial stage the earliest, but be to use picture writing and pictograph some entity things beyond expression of words and abstract things.Modern concept plan is a kind of the directly perceived of avatars that both kept, the semantic meaning representation mode that has simultaneously stronger abstract semantic meaning representation ability again, because concept map has the ability of describing first order logic, so concept map usually is used to record and expresses thought process.Concept map is a kind of method of organizing and express notion and the relationship of the concepts with graphic interpretation.How youngster university C (Joseph D.Novak) proposes according to the meaningful learning of Su Beier difficult to understand (David P.Ausubel) is theoretical concept map by U.S.'s health as far back as the sixties in 20th century, but concept map (Concept Maps) speech just was suggested up to the eighties in 20th century.Novak thinks that concept map is the graph-based of the notion and the relation thereof of certain theme, and concept map is the instrument that is used for organizing and characterizing knowledge.Concept map is placed on the relevant notion of a certain theme in circle or the square frame usually, with line relevant notion is connected with proposition then, indicate on the line that two meanings relations between the notion (draw from Novak, J.D., The Theory Underlying Concept Maps and How toConstruct Them.Cornell University, 1982).
The principal character of concept map method is to get in touch the relation that presents intuitively between notion and the notion by illustrated mode setting up various explicit figures between different notions.Various concept map instruments in the market have a lot, and external representational part product has CmapTools, ConceptDraw, and Inspiration etc., domestic representational product has Keystone etc.
At present, the concept map instrument only provides the function of retrieval according to keyword, and do not provide direct retrieval complex concept and relation (notion and the relation that constitute by a plurality of simple concepts and incidence relation), the user is when retrieval, can only take indirect mode, after promptly can only according to keyword retrieving simple concept or simple relation relevant with waiting to look into complex concept or complicated incidence relation, navigate to the viewing area at this simple concept or simple relation place earlier, and then move this viewing area and confirm that progressively whether this relation is exactly that the step of target to be found is finished retrieval, this interactive operation mode is loaded down with trivial details, and need the very big energy of cost user to add their confirmation.For the user of these instruments, press for the function of incidence relation between quick retrieval concept of a kind of method energy and notion, particularly need a kind of method and can retrieve the function of specifying complex concept or complex relationship fast.
Present concept map instrument is that the data with whole figure are that unit stores, handles and shares, therefore, if the data volume of a concept map is bigger, particularly the view data that comprises in figure more for a long time, the pairing data volume of whole concept map is just big more, thereby cause when sharing, will need the bigger network bandwidth in the process of data transmission and cause longer transmission delay by network.Because the internal memory that concept map software is all put into data processing equipment to the data of whole figure is operated, therefore the memory source to the data treatment facility requires also higher; Whole diagram data processing mode makes that the granularity of data processing is bigger, thereby be unfavorable for realizing that the multi-user reaches shared to the concurrent processing of a plurality of objects in the concept map, particularly under large-scale and multiple users concurrent processing, shared magnanimity concept map data conditions, to directly cause data handling system to be difficult to further improve handling property, and can cause when sharing mass data, making the probability of data access conflict to increase, and then cause occurring the system performance bottleneck.
Summary of the invention
The object of the present invention is to provide and a kind ofly can directly retrieve related information in the associated data, be convenient to that multi-user concurrent is handled and relate to index, retrieval, data storage and present the infosystem of control what the information after handling was shared flexibly.
Directory system of the present invention comprises the data block of two relevant relations at least, each data block all is made up of positional information piece and content information piece, the content information piece is the remainder data except the positional information piece in the data block, the positional information of positional information piece record and related other data block of notebook data piece; Generate index data according to following steps:
(1). set up sequence one: select a data block (a), with its positional information (P
a) as the first term of sequence, from the positional information piece of data block (a), choose a positional information (P again
b) as the 2nd of sequence, from the positional information piece of data block (b), choose a positional information (P then
c) as the 3rd of sequence, in like manner, a positional information (P who from the positional information piece of data block (c), chooses
d) as the 4th of sequence, set up sequence (P according to this corresponding relation
a, P
b, P
c, P
d...), do not stop when in the positional information piece, having the length of selectable location information or this sequence to reach preseting length;
(2). set up sequence two: part or total data with content information piece in the data block of footnote correspondence under each positional information in the sequence one are set up sequence (C
a, C
b, C
c, C
d...);
(3). set up character string:, generate character string with comprising every in the sequence two at least and not changing every sequencing;
(4). determine the keyword of index record: make keyword with the character string described in the step (3);
(5). determine the address information of index record: at least one different item is as address information (P in the selection sequence one
a, P
b, P
c...);
(6). the address information coupling that the keyword and the step (5) of step (4) generation are determined generates an index record;
(7) repeating step (1) generates index data to step (6) to all data blocks.
All inequality for each of sequence one in the above-mentioned directory system.Keyword also can be by every generation of a certain subsequence of sequence two.
Based on above-mentioned directory system, search method of the present invention is: the information according to user's input generates described data block set, use the method generation term that generates keyword corresponding to described directory system, retrieve with this term then, and the result is shown.
Infosystem of the present invention, at least the data block that comprises two relevant relations, each data block is all by the positional information piece, content information piece and geological information piece are formed, the positional information piece is used to write down the positional information with related other data block of notebook data piece, the geological information piece is used for recording data blocks when exporting on output device used coordinate information and geometry information, the geological information of different pieces of information piece can be revised independently, what the content information piece write down is the remainder data except positional information piece and geological information piece in the data block, each data block finally is separately stored in the non-volatile memory device, does not belong to the content of creating in the geometric areas of arbitrary current piece of video data and all be stored in the data block of independent access in the viewing area.
The authority control method that the present invention is based on above-mentioned infosystem is: described data block is made up of positional information piece, authority information piece, geological information piece and content information piece, wherein content information piece record is the information except positional information piece, geological information piece and authority information piece in the data block, the authority information piece is used for record and allows which user to carry out which operation permission information, and the user can only carry out the operation that authority allowed to data block.
Display control method based on above-mentioned infosystem is: the demonstration of control data piece as follows:
(1). with two empty hash table Q and M;
(2). will be video data piece and need the positional information of data presented piece to add in one of them hash table (Q);
(3) if. Q is that sky just stops procedure for displaying, if Q is not empty, an optional positional information (P from Q then
a), and the data block that it is corresponding (a) is called in internal memory;
(4) with the described positional information (P of step 3
a) from Q, remove, with the described positional information (P of step 3
a) join among the M;
(5) if described positional information (P
a) geometric areas at pairing data block (a) place and current display area intersect, then show this data block, otherwise this data block is destroyed from internal memory, and return step (3);
(6) if the content of the positional information piece of data block (a) is not empty, the positional information that then all is not appeared in the block of locations of (a) among the M is added among the Q;
(7) repeating step 3-6.
The step of above-mentioned display control method (5) can also be: if described positional information (P
a) geometric areas at pairing data block (a) place and current display area intersects and the user has the authority that shows this data block, then show this data block, otherwise this data block is destroyed from internal memory, and return step (3).
The invention has the beneficial effects as follows: infosystem of the present invention writes down associated data by the described data block of using separate, stored, thereby help writing down the new object and the new incidence relation that are easy to retrieve, and help corresponding data ground flexible access, demonstration are reached processing such as shared, help to realize index and retrieval especially to complex object and multidimensional incidence relation, and the tissue that makes information (particularly Word message) uses and more meets the netted information organization mode of getting in touch between things in the real world, and no longer is limited to the organizational form of one-dimensional sequence.In data handling system, create in the data block of relevant relation, just can generate the related information that special keyword be used for the record data interblock automatically, the difficult problem that this method helps to reduce even ambiguity is handled in the semantic analysis process when avoiding index data according to the content of data block.The present invention will reflect the content of the special character string of incidence relation between the data block as index data and search condition, feasible possessed the ability of index and the complicated incidence relation of retrieve data interblock based on infosystem of the present invention, thereby help to realize retrieval (the general retrieval based on the keyword matching technique of comparing) comparatively accurately.Storage based on data block, index and (two dimension or multidimensional) are graphical to show output to infosystem of the present invention by using, realized to related information intuitively, write down easily, store, retrieve and show.
Infosystem of the present invention because all separate, stored and the accesses of each data block, thereby helps to reduce the probability that access conflict may take place when the multi-user visits a plurality of data block simultaneously, and this also helps the parallel raising of setting up the index performance of directory system simultaneously.Adopt that independently data block store and access mode also are convenient to enlarge the processing capacity of system and improve parallel processing capability by simply increasing data processing equipment based on index of the present invention, retrieval and sharing functionality.The user is by the network download data with in the client process data time, can the current data of being concerned about of prioritised transmission user (as be in the current display area data block), the content of not paid close attention to (as there not being data presented piece in current display area) then can transmit on the backstage, perhaps delays and transmits or do not transmit; In case not in the territory, output display area the time, just can after the data block in the internal memory being saved in non-volatile memory device, immediately this object be removed from internal memory by the focused data piece.Such processing mode helps reducing network bandwidth consumption and accounts for, improve network utilisation efficient, the consumption that can also reduce the user side memory source simultaneously accounts for, particularly when the incidence relation that presents with diagramatic way between data block and data block, use the storage mode of data block to carry out access and processing, can make memory source consumption to system account for rate and remain at lower level.When output device was supported the two dimension or the three-dimensional way of output, the user can browse custom by moving the web that (two dimension or three-dimensional mobile) current display area changes traditional page switching mode.When using the data block mode to store the information of sharing, help to realize fast, flexibly between the multi-user information of sharing editor, modification, transmit and present, thereby help setting up the cooperative working environment that area of computer aided is supported; Simultaneously, helping user interface program based on the control of authority of separate, stored data block and display control method realizes presenting flexibly, editor, revise, the function of deletion and shared data piece, solved current internet use in the information processing granularity bigger, be difficult to its processing that walks abreast be handled (as adding by the multi-user, deletion, revise, explain, mark etc.) and flexibly share the deficiency of processing back gained information, and help to change the circumstances that people in traditional web server one browser application mode usually is in passive reception information, thereby help to quicken and promote (people's) knowledge processing (preservation of knowledge, accumulation, arrangement, retrieval and share) iterative process, promote the evolution of knowledge.
Description of drawings
Fig. 1 is the concept map that need set up index
Fig. 2 is the data block that generates at Fig. 1 concept map.
Fig. 3 is the concept map of first kind of embodiment retrieving.
Fig. 4 is the data block that generates at Fig. 3 concept map.
Fig. 5 is the another kind of data block that generates at Fig. 3 concept map.
Fig. 6 is the concept map of second kind of embodiment retrieving.
Fig. 7 is the data block that generates at Fig. 6 concept map.
Fig. 8 is the concept map of the third embodiment of retrieving.
Fig. 9 is the data block that generates at Fig. 8 concept map.
Figure 10 is the concept map of the 4th kind of embodiment retrieving.
Figure 11 is the data block that generates at Figure 10 concept map.
Figure 12 is based on the concept map of data block control of authority embodiment.
Data block when Figure 13 is the write permission of the data block a, the b that user 1 are not created of user 2, c.
Figure 14 is the data block of user 2 when having the write permission of data block a, b that user 1 is created, c.
Figure 15 is based on the demonstration control flow chart of separate, stored data block.
Geological information in the above-mentioned accompanying drawing in each data block is used for size, shape and the position of recording data blocks when being shown.Because how to represent and definite object between geometric relationship be unusual proven technique, for convenience of description, among the present invention not the concrete expression mode to geological information do detailed explanation.
Embodiment
One, the embodiment of directory system of the present invention:
This is one and sets up the embodiment of index at concept map, referring to Fig. 1-Fig. 5.
Shown in Figure 1 is a concept map, this notion there is shown the contact between three notions (notion a, notion b, notion c) and these notions, each notion all is a figure that comprises text, the ellipse that includes character string " text A " such as notion a exactly, notion b includes the ellipse of character string " text B " exactly, and notion c includes the ellipse of character string " text C " exactly.Contact between notion is represented with lines (as the straight line, curve etc. of band arrow), literal on the lines is used to represent the type of its contact, straight line as left side band arrow, the printed words that " arrow 1 " arranged above, straight line as the right band arrow, the printed words that " arrow 2 " arranged above, " arrow 1 " and " arrow 2 " is used to identify the relation of arrow.Each notion in the concept map shown in Figure 1 all uses different data blocks to be expressed as the data block set of Fig. 2 with the contact between notion.Wherein, data block a is used to represent notion a, and data block b is used to represent notion b, and data block c is used to represent notion c, and data block d is used to represent the arrow 1 of Anknupfungskeregriff a and notion b, and data block e is used to represent the arrow 2 of Anknupfungskeregriff b and notion c.Wherein, the content of text of notion a is " text A ", the content of text that notion b comprises is " text B ", the content of text that notion c comprises is " text C ", arrow contact and its content of text that comprises of arrow 1 expression Anknupfungskeregriff a and notion b are " arrow 1 ", the curvilinear correlation of curve 1 expression Anknupfungskeregriff a and notion b and the content of text that comprises are " curve 1 ", and the arrow contact of arrow 2 expression Anknupfungskeregriff b and notion c and the content of text that comprises are " arrow 2 ".
The positional information of data block can use URL or URI to represent.
Set up index data (it is 5 that maximal sequence length is specified in supposition) at Fig. 2 data block:
(1). set up sequence one (present embodiment has provided four kinds of methods):
Method 1: select data block a, with its positional information P
a(positional information of expression subscript a institute corresponding data piece) as the first term of sequence, chooses article one positional information P again from the positional information piece of data block a
dAs sequence the 2nd chooses article one positional information P then from the positional information piece of data block d
aAs the 3rd of sequence, the rest may be inferred then up to reaching specified sequence length, obtains sequence (P
a, P
d, P
a, P
d, P
a);
Method 2: select data block a, with its positional information P
aAs the first term of sequence, from the positional information piece of data block a, choose second positional information P again
fAs sequence the 2nd chooses second positional information P then from the positional information piece of data block f
bAs the 3rd of sequence, the rest may be inferred then, obtains sequence (P
a, P
f, P
b, P
e, P
c);
Method 3: select data block a, with its positional information P
aAs the first term of sequence, from the positional information piece of data block a, choose the arbitrary positional information P that does not occur in the sequence again
dAs the 2nd of sequence, from the positional information piece of data block d, choose the arbitrary positional information P that does not occur in the sequence then
bAs the 3rd of sequence, the rest may be inferred then, obtains sequence (P
a, P
d, P
b, P
e, P
c);
Method 4: a subsequence of institute's calling sequence in the system of selection 3, as (P
a, P
b, P
c);
(2). set up sequence two: set up following sequence according to the data of the content information piece of the data block of footnote correspondence under each positional information corresponding to the position sequence that each method generated in the step 1:
Method 1:(text A, arrow 1, text A, arrow 1, text A)
Method 2:(text A, curve 1, text B, arrow 2, text C)
Method 3:(text A, arrow 1, text B, arrow 2, text C)
Method 4:(text A, text B, text C)
(3). set up character string:
Method 1: " text A arrow 1 text A arrow 1 text A "
Method 2: " text A curve 1 text B arrow 2 text C "
Method 3: " text A arrow 1 text B arrow 2 text C "
Method 4: " text A text B text C "
(4). determine the keyword of index data: use the character string described in the step (3) respectively as different keywords;
Method 1: " text A arrow 1 text A arrow 1 text A "
Method 2: " text A curve 1 text B arrow 2 text C "
Method 3: " text A arrow 1 text B arrow 2 text C "
Method 4: " text A text B text C "
(5). determine the address information of index data: with the one or more different item in the sequence one as address information;
Method 1:P
a, P
d
Method 2:P
a, P
f, P
b, P
e, P
c
Method 3:P
a, P
d, P
b, P
e, P
c
Method 4:P
a, P
b, P
c
(6). generate index record
Method 1:[" text A arrow 1 text A arrow 1 text A ", (P
a, P
d)]
Method 2:[" text A curve 1 text B arrow 2 text C ", (P
a, P
f, P
b, P
e, P
c)]
Method 3:[" text A arrow 1 text B arrow 2 text C ", (P
a, P
d, P
b, P
e, P
c)]
Method 4:[" text A text B text C ", (P
a, P
b, P
c)]
(7). select data block b, c, d, e repeating step 1-6 then, generate other index data.In above-mentioned step (2), can also only use the part data of content-data piece to generate sequence two:
Method 1:(A, arrow 1, A, arrow 1, A)
Method 2:(A, curve 1, B, arrow 2, C)
Method 3:(A, arrow 1, B, arrow 2, C)
Method 4:(A, B, C)
Perhaps
Method 1:(A, arrow, A, arrow, A)
Method 2:(A, curve, B, arrow, C)
Method 3:(A, arrow, B, arrow, C)
Method 4:(A, B, C)
In above-mentioned step (3), can also adopt at every two ends and add character or character string generating character string:
Method 1: "＜text A〉＜arrow 1〉＜text A〉＜arrow 1〉＜text A〉"
Method 2: "＜text A〉＜curve 1〉＜text B〉＜arrow 2〉＜text C〉"
Method 3: "＜text A〉＜arrow 1〉＜text B〉＜arrow 2〉＜text C〉"
Method 4: "＜text A〉＜text B〉＜text C〉" in above-mentioned step (3), can also adopt the separated place interpolation character string at every to generate character string
Method 1: " text A| arrow 1| text A| arrow 1| text A "
Method 2: " text A| curve 1| text B| arrow 2| text C "
Method 3: " text A| arrow 1| text B| arrow 2| text C "
Method 4: " text A| text B| text C "
Wherein symbol "＜", "〉" and " | " can adopt other character.
When the character string that is used for keyword is very long, in step (6), adopt a certain hashing algorithm (as MD5, SHA etc., the MD5 hashing algorithm of using in this example) hashed value of calculating keyword, and be primary keyword with this hashed value, with former keyword is auxilliary keyword, positional information is constant, generates index record.For example, use the ANSI coded string, the index record that obtains in the step (6) when adopting hashing algorithm MD5 following (, using 16 system string representation hashed values) for ease of describing:
Method 1:[" 7BF93490B2766297BD08A4247835B3B3 ", " text A arrow 1 text A arrow 1 text A ", (P
a, P
d)]
Method 2:[" 421832D457CB458D13E6E0FB55266C7C ", " text A curve 1 text B arrow 2 text C ", (P
a, P
f, P
b, P
e, P
c)]
Method 3:[" 6D78190851FE8313BFF46E1438921352 ", " text A arrow 1 text B arrow 2 text C ", (P
a, P
d, P
b, P
e, P
c)]
Method 4:[" 2117BB3BF7FC07164614D83FB6416928 ", " text A text B text C ", (P
a, P
b, P
c)]
The content information piece of data block described in the directory system of the present invention can be data such as the input of literal, figure, image, audio frequency, video, computer peripheral and output order.
Two, the embodiment of search method:
When retrieving with search method of the present invention, following of general situation need directly provide ADB associated data block, produces described special character string automatically by system then and retrieves, and also can manually provide special character string and retrieve.When adopting computer screen as human-computer interaction interface, the user can retrieve relation between each notion and the notion by graphic technique.Four diagram retrieval embodiments have below been provided, referring to Fig. 3-Figure 11.
Embodiment one:
This is the embodiment that the present invention is used to illustrate retrieval: referring to Fig. 3-Figure 11.
When the user in when retrieval, at first provide concept map as shown in Figure 3 by human-computer interaction interface, system generates data block set as shown in Figure 4 with this concept map: data block a represents to include the notion a of content of text " A ", data block b represents to include the notion b of content of text " B ", data block c represents to include the notion c of content of text " C ", data block d represents the arrow 1 of Anknupfungskeregriff a and notion b and comprises content of text " arrow 1 ", data block e represents the arrow 2 of Anknupfungskeregriff b and notion c and comprises content of text " arrow 2 ", for example, generate the method for keyword in according to the method 4 of step (6), can obtain term " text A text B text C ", search index with this term then, return result for retrieval (P
a, P
b, P
c), then by man-machine interface, will call in internal memory and show these data blocks corresponding to the data block of these addresses according to the geological information of data block, these data blocks are represented to the user.
Fig. 3 also can be expressed as the data block set of Fig. 5, and wherein the starting point of relation represented in suffix " s ", the terminal point of suffix " e " expression relation.When generating character string, what use is the not method of repeating data piece of choosing of method 3 in the step (1), can obtain character strings such as " text A| arrow 1| text B| arrow 2| text C " so too, if at this moment be to generate index data, so only the positional information of data block that need this character string is corresponding with it is deposited in the database together and gets final product.If in when retrieval, so the character string that obtains is directly carried out matched and searched in the index data and return results gets final product.
Obtaining term " text A text B text C " afterwards, using the MD5 algorithm to obtain its hashed value " 2117BB3BF7FC07164614D83FB6416928 ", in index, searching then.The hashed value of using character string as the keyword of index can so that the storage space that index uses still less, this is because the result of MD5 hashing algorithm has only 16 bytes, therefore can use index stores space still less, in addition, carry out matched and searched to remote server or other client again after in inquiry, can calculating hashed value earlier by client, come thereby help calculating shared, be convenient to the realization of extensive searching system.When running into the situation that identical hashed value is arranged, and then carry out matched and searched with term as auxilliary keyword and get final product.
Embodiment two: referring to Fig. 6 and Fig. 7.At first the user provides Fig. 6 concept map, system generates the set of Fig. 7 data block according to concept map shown in Figure 6 then, data block a is used to represent notion a, data block b is used to represent notion b, data block c is used to represent notion c, data block d is used to represent the arrow 1 of Anknupfungskeregriff a and notion b, and data block e is used to represent the arrow 2 of Anknupfungskeregriff a and notion c.Wherein, the content of text that notion a comprises is " text A ", the content of text that notion b comprises is " text B ", the content of text that notion c comprises is " text C ", arrow contact and its content of text that comprises of arrow 1 expression Anknupfungskeregriff a and notion b are " arrow 1 ", and the arrow contact of arrow 2 expression Anknupfungskeregriff b and notion c and the content of text that comprises are " arrow 2 ".Then can obtain term " text A| arrow | text B " and " text A| arrow | text C " by data block shown in Figure 6 set, when retrieval, the common factor of getting the positional information set that these two result for retrieval return is as retrieval set, then the data block of retrieval set is called in internal memory and show these data blocks, these data blocks are represented to the user according to the geological information of data block.
Embodiment three: referring to Fig. 8 and Fig. 9, reflection be notion with relation of inclusion, in this case, the relation between notion is inenarrable with the prior art Chinese version.The notion that is comprised in the particularly illustrated content is very many, and when having complex relationship between involved notion, adopt the organizational form of data block of the present invention to come explicit differentiation notion and adopt the positional information piece to come the explicit abstraction relation that shows between notion, the information that can reflect the relation of depositing in the diagram exactly, and and then generate with this and to concern index data accurately.At first the user provides Fig. 8 concept map, system is according to the data block among Fig. 8 concept map generation Fig. 9 then, wherein, when the viewing area of certain notion comprises other notion, then generate a new data block and be used to represent this relation of inclusion, and the content of text of the content information piece of this new data block is " comprising ", the positional information piece then includes the positional information of all data blocks that satisfy involved relation, data block a is used to represent notion a, data block b is used to represent notion b, data block c is used to represent notion c, and data block d is used to represent the arrow of Anknupfungskeregriff b and notion c, and data block e is used to represent that notion a comprises notion b, the relation of notion c and arrow.Wherein, the content of text of notion a is " text A ", the content of text that notion b comprises is " text B ", the content of text that notion c comprises is " text C ", arrow represents that the arrow contact of Anknupfungskeregriff b and notion c and its content of text that comprises are " arrow ", can by data block set shown in Figure 9 obtain searching character string "＜text A〉＜comprise＜＜text B＜arrow＜text C ".In index after the retrieval, the data block of the address information correspondence that obtains is called in internal memory and shown these data blocks according to the geological information of data block, these data blocks are represented to the user.
Embodiment four: referring to Figure 10 and Figure 11.What this embodiment was represented is that overlapping relation is arranged between each notion: at first provide concept map shown in Figure 10 by the user, system generates the set of Figure 11 data block according to Figure 10 then, wherein, data block a is used to represent notion a, data block b is used to represent notion b, by Figure 11 data block set can obtain searching character string "＜A〉＜intersect＜B " laggard line retrieval.And then will call in internal memory and show these data blocks according to the geological information of data block corresponding to the data block of result for retrieval (address information), these data blocks are represented to the user.
If the length of appointment is 1 o'clock, then index or retrieval are equivalent to existing index or searching system based on keyword in the step (1) that generates keyword for index of the present invention or searching system.
Index of the present invention or searching system also can be extended to the three-dimensional or the situation of multidimensional human-computer interaction interface more, and at this moment the data in the geological information piece comprise the more spatial information of multidimensional.The present invention is specially adapted to be expressed as the record and the inquiry of related information between a plurality of incidents with logic association, time correlation or space correlation, a plurality of things or a plurality of object, for example geography information, book category information etc.
From above-mentioned four kinds of retrieval embodiments as can be seen, when the user uses the diagram search method of describing among the present invention, the user only need configure notion in the diagram relation and the incidence relation between notion, system is converted into after corresponding data block represents automatically, generate special character string according to the method for the invention, just can retrieve as search condition with this character string again incidence relation between the notion that is had in the diagram, this method is simple and clear, and more approach human natural expression way, thereby can when retrieval, make user's more concern describe the content that to search in how, and need not to pay close attention to the concrete literary style of the special character string corresponding, the human-computer interaction interface that this provides convenience for the user of this this infosystem with query contents; Simultaneously, because the more common keyword retrieval method of this diagram search method more can be described incidence relation between things and things or object and object (as the things that gets up by time or space correlation or the incidence relation between the object) intuitively, easily, therefore help people when retrieving, describe more accurately want the content of inquiring about.
The user can also provide more complex conception figure, the user only need configure the relation between notion and the notion, because these concept maps can generate and the corresponding data block set of concept map, therefore, concerning under the enough detailed prerequisite of index data, the incidence relation that is provided during retrieval complete more or detailed more (generating special keyword as the method three in the use step (1) retrieves), then retrieve as search condition, just can obtain result for retrieval more accurately with this concept map diagram.If with the part relationship description formula that exists in the diagram is search condition, then searching system can provide and relevant, the similar or close result for retrieval of complete diagram relation.
Index of the present invention and searching system are not limited to the such application of concept map, concept map only is the data block described in the present invention and one of the presentation mode of incidence relation therebetween, data block present or manifestation mode can also have other mode, for example San Wei stereo representation.In addition, in this data presentation method of concept map, some contacts also need not explicitly and present, this contact is invisible, but can be retrieved, this invisible contact, can obtain by preset rule, for example data block is when being presented, can obtain geological information mutual between them by the geometric areas of measuring between them, as involved, intersect, the relative orientation at place, distance etc., these contents can be coded in the data block, and also can become the object of index, thereby can realize these information ground retrievals.
Three, the embodiment of infosystem of the present invention: concept map shown in Figure 3 is arranged on display screen, according to the difference of the preserving type of incidence relation information (incidence relation independently with non-separate, stored), on non-volatile memory device or be stored as five (referring to Fig. 4, during the incidence relation separate, stored) or be stored as the data block of three (referring to Fig. 5, incidence relation as the storage of the some of content-data time) separate, stored.Each data block of this infosystem is all by the positional information piece, content information piece and geological information piece three are partly formed, the positional information piece is used to write down the stored position information with related other data block of notebook data piece, the geological information piece is used for recording data blocks when exporting on screen coordinate information and geometry information, for example, the figure of notion a (ellipse) is when being moved by the user in Fig. 3, when if the user has the authority of revising data block a (corresponding to the data block of notion a), then the geological information of data block a can be revised and be gone on record independently, what the content information piece write down is the remainder data except positional information piece and geological information piece in the data block, and each new data block of creating in the system is separately stored in the non-volatile memory device.The operation of data block is divided into two kinds of situations: first kind is incidence relation during as the data block of separate, stored (referring to Fig. 4), at first in the viewing area, mark a geometric areas, and in this zone, fill out " text A " and be used to represent notion a, data block a corresponding to this geometric areas is a separate, stored, in like manner can set up data block b and data block c, when between notion a and notion b, setting up the contact of " arrow 1 ", set up a new data block d and be used for expression " arrow 1 ", and in the positional information piece of data block a and data block b insertion position information P all
d, in the positional information piece of data block d, insert P
aAnd P
b, similarly, when between notion b and notion c, setting up " arrow 2 " contact, then generate data block e, and in the positional information piece of data block e, insert P
bAnd P
c, in the positional information piece of data block b and c, all insert P simultaneously
eWhen arrow 1 contact that will delete between notion a and the notion b, then with P
dFrom the positional information piece of data block a, b, delete, and data block d is deleted from non-volatile memory device, when geometric position of revising notion or outward appearance, only need to revise the coordinate or the geometry information of respective data blocks.Second kind of situation is the situation (referring to Fig. 5) during as content-data piece a part of incidence relation, at first in the viewing area, mark a geometric areas, and in this zone, fill out " text A " and be used to represent notion a, data block a corresponding to this geometric areas is a separate, stored, in like manner can set up data block b and data block c, when between notion a and notion b, setting up the contact of " arrow 1 ", in the positional information piece of data block a, insert P
bAnd the title " arrow 1-s " of corresponding contact is write in certain zone in the content-data of data block a, " s " represents starting point, if (system adopts the presentation mode of the arrow of predefined (when for example adopting the straight arrows that connects two notions, this arrow can be directly by the centre coordinate of two notions with and the border determine), can only write down the title of arrow so and need not write down the geological information of incidence relation, otherwise, for the concrete geometric configuration of detailed each contact of embodiment, therefore can in content information, write down the geological information of this incidence relation simultaneously.In the content-data in every the order in the zone of record incidence relation title or type and the positional information piece order of each positional information be corresponding), same, in the positional information piece of data block b, insert P
a, and in the content information piece of data block b, write down corresponding to P
aConcern relation information " arrow 1-e ", the terminal point of " e " expression incidence relation similarly, when setting up " arrow 2 " contact between notion b and notion c, then adds P in the positional information piece of data block b
cAnd on the record of the corresponding region in the content information piece of data block b " arrow 2-s ", simultaneously on the record of the corresponding region in the content information piece of data block c " arrow 2-e ".When arrow 1 contact that will delete between notion a and the notion b, then with the P in the positional information piece of data block b
aAnd corresponding to P
aThe incidence relation geological information from deleting, simultaneously with the P in the positional information piece among the data block a
bAnd corresponding to P
bThe incidence relation geological information delete, when geometric position of revising notion or outward appearance, only need to revise corresponding coordinate or geometry information gets final product.
When the data of this infosystem being carried out index and retrieval, can adopt traditional indexing means and search method based on general keyword matching technique, also can adopt indexing means provided by the present invention and search method.
By ICP/IP protocol or P2P agreement, connect at two or more networks of can setting up between based on the infosystem of infosystem of the present invention, retrieve and download its data blocks stored between a plurality of systems thereby be implemented in, owing to the diagram of each notion shared with the data block of independent access and realize control of authority, this makes the concept figure in real-time update and the shared current display interface become easily, thereby helps to realize the concept map network environment of live collaboration.The user can determine whether allowing other user access, modification, deletion or video data piece by the authority information that each data block is set.
Infosystem of the present invention is can be by separate modification between each data block when presenting data block.As long as the user has the corresponding authority to current data block, just can revise the information in this data block.Such as positional information, content information, geological information, when location revision information, the user increases or the incidence relation of deletion current data block and other data block, the corresponding contents in just can location revision information; Geological information equally also can be modified (for example creating, move, rotate, change figure etc.), there is essential distinction in the system that shows based on formatted text in this point system of the present invention and the prior art (as the browser that shows based on hypertext), and data block of the present invention not only is convenient to embody incidence relation between the data but also separate, stored in non-volatile memory device, these characteristics make it associated data is carried out sharing flexibly and showing control, and be convenient to the multi-user concurrent processing, this is that concept map is irrealizable in the prior art.
Four, based on the control of authority embodiment of data block: referring to Figure 12,13,14
If Fig. 3 concept map is that user 1 creates, user 2 increases a notion d (referring to Figure 12) on concept map shown in Figure 3, its corresponding data block is data block d (referring to Figure 13), and the geometric areas of notion d is with notion a, the geometric areas of notion b and notion c is included in its inside, if user 2 does not prescribe a time limit to the power of amendment of user 1 data block of creating, at this moment the corresponding data block set that generates as shown in figure 13, so both avoided the data block that user 1 is had is made amendment, realized simultaneously noting in the same viewing area with processed information the purpose of the information that obtains after user's 2 processing again, this helps user 2 in the future to understand the history of evolution of relevant informations or knowledge; And when user 2 has the power of amendment of notion a, b, the pairing data block of c is prescribed a time limit, the data block set of generation is as shown in figure 14.Operations such as deletion, modification, demonstration and access to data in the data block are all controlled according to the authority information in the data block.The authority information of each data block can only or by the user who creates this data block, or the user who has authority who writes down in the authority piece of data block, or the system manager could revise.
Five, the demonstration control flow of data block as shown in figure 15, an embodiment of display control method is: if system has shown concept map as shown in Figure 3, (for example the user moves current display window by mouse or wherein during the position of certain notion when the interface need be upgraded so, perhaps created new notion, when perhaps having deleted certain notion or incidence relation or having revised the geological information of certain notion, when transferring rectangle to as profile by ellipse), will excite execution once to show control:
(1) at first empties two hash table Q and M;
(2) positional information with current three data blocks that shown (with Fig. 5 data block store Fig. 3 information time) joins among the Q;
(3) if Q be sky then stop to show control, get a positional information (P otherwise from Q, appoint
a), if there is not the content of corresponding data piece (a) in the internal memory, then data block (a) is called in the internal memory;
(4) with (P
a) from Q, delete, and with (P
a) join among the M;
(5) geological information and the current display area with data block (a) compares, if geometric areas (a) and current display area intersect and the active user has the authority that shows this data block, then according to the geological information video data piece (a) of data block (a), otherwise (a) destroys from internal memory with data block, and returns step (3);
(6) positional information that all is not appeared in the positional information piece of the data block (a) among the M is added among the Q;
(7) repeating step (3)-(6).
When adding a notion d in Fig. 3, the user (sees Figure 12 and Figure 13), the step of display control method (2) is revised as " current three data blocks that shown (with Fig. 5 data block store Fig. 3 information time) and the positional information of data block d are joined among the Q ", repeating step (3)-(6) then.
Claims (10)
1. the directory system of an associated data, it is characterized in that comprising at least the data block of two relevant relations, each data block all is made up of positional information piece and content information piece, the content information piece is the remainder data except the positional information piece in the data block, and the positional information piece is used to write down the stored position information with related other data block of notebook data piece; Generate index data according to following steps:
(1). set up sequence one: select a data block (a), with its positional information (P
a) as the first term of sequence, from the positional information piece of data block (a), choose a positional information (P again
b) as the 2nd of sequence, from the positional information piece of data block (b), choose a positional information (P then
c) as the 3rd of sequence, in like manner, a positional information (P who from the positional information piece of data block (c), chooses
d) as the 4th of sequence, set up sequence (P according to this corresponding relation
a, P
b, P
c, P
d...), do not stop when in the positional information piece, having the length of selectable location information or this sequence to reach preseting length;
(2). set up sequence two: part or total data with content information piece in the data block of footnote correspondence under each positional information in the sequence one are set up sequence (C
a, C
b, C
c, C
d...);
(3). set up character string:, generate character string with comprising every in the sequence two at least and not changing every sequencing;
(4). determine keyword: make keyword with the character string described in the step (3);
(5). determine address information: at least one different item is as address information (P in the selection sequence one
a, P
b, P
c...);
(6). the address information coupling that the keyword and the step (5) of step (4) generation are determined generates an index record;
(7) repeating step (1) generates index data to step (6) to all data blocks.
2. directory system according to claim 1, each that it is characterized in that described sequence one is all inequality.
3. directory system according to claim 1 and 2 is characterized in that at least one (C in the sequence two
a) content-data that referred to is divided into n zone, making up length is the sequence three of m, 1＜m≤n, every certain regional data of selecting in the described n zone in this sequence, with comprising that at least every in the sequence three generates character string, with the respective items (C in the described character string of this character string replacement step (3)
a).
4. according to the described directory system of one of claim 1-3, it is characterized in that the every generation of keyword by a certain subsequence of sequence two.
5. according to the described directory system of one of claim 1-4, the hashed value that obtains after it is characterized in that handling through hashing algorithm with described keyword is as the primary keyword of index data, with the auxilliary keyword of described keyword as index data.
6. search method corresponding to one of claim 1-5 described directory system, it is characterized in that gathering according to the described data block that the information that the user imports generates, use the method generation term that generates keyword corresponding to described directory system, retrieve with this term then, and the result is shown.
7. infosystem, it is characterized in that comprising at least the data block of two relevant relations, each data block is all by the positional information piece, content information piece and geological information piece are formed, the positional information piece is used to write down the positional information with related other data block of notebook data piece, the geological information piece is used for recording data blocks when exporting on output device used coordinate information and geometry information, the geological information of different pieces of information piece can be revised independently, what the content information piece write down is the remainder data except positional information piece and geological information piece in the data block, each data block finally is separately stored in the non-volatile memory device, does not belong to the content of creating in the geometric areas of arbitrary current piece of video data and all be stored in the data block of independent access in the viewing area.
8. authority control method based on the described infosystem of claim 7, it is characterized in that, described data block is made up of positional information piece, authority information piece, geological information piece and content information piece, which user is control of authority message block be used to write down can be carried out for which operation permission information, wherein content information piece record is the information except positional information piece, geological information piece and authority information piece in the data block, and the user can only carry out the operation that authority allowed to data block.
9. display control method based on the described infosystem of claim 7 is characterized in that the demonstration of control data piece as follows:
(1). with two empty hash table Q and M;
(2). will need the data presented piece and the positional information of the data block that has been presented adds in one of them hash table (Q) in the viewing area;
(3) if. Q is that sky just stops to show control procedure, if Q is not empty, an optional positional information (P from Q then
a), if there be not the data block corresponding with it in the internal memory, then that it is corresponding data block (a) is called in internal memory;
(4) with the described positional information (P of step 3
a) from Q, remove, with the described positional information (P of step 3
a) join among the M;
(5) if described positional information (P
a) geometric areas at pairing data block (a) place and current display area intersect, then show this data block, otherwise this data block is destroyed from internal memory, and return step (3);
(6) positional information that all is not appeared in the block of locations of the data block (a) among the M is added among the Q;
(7) repeating step 3-6.
10. display control method based on the described infosystem of claim 8 is characterized in that the demonstration of control data piece as follows:
(1). with two empty hash table Q and M;
(2). will need the data presented piece and the positional information of the data block that has been presented adds in one of them hash table (Q) in the viewing area;
(3) if. Q is that sky just stops to show control procedure, if Q is not empty, an optional positional information (P from Q then
a), if there be not the data block corresponding with it in the internal memory, then that it is corresponding data block (a) is called in internal memory;
(4) with the described positional information (P of step 3
a) from Q, remove, with the described positional information (P of step 3
a) join among the M;
(5) if described positional information (P
a) geometric areas at pairing data block (a) place and current display area intersects and the user has the authority that shows this data block, then show this data block, otherwise this data block is destroyed from internal memory, and return step (3);
(6) positional information that all is not appeared in the block of locations of the data block (a) among the M is added among the Q;
(7) repeating step 3-6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710192532A CN100576209C (en) | 2007-12-07 | 2007-12-07 | Associated data index, retrieval, store and present the control information system constituting method |
| PCT/CN2008/001969 WO2009086730A1 (en) | 2007-12-07 | 2009-01-07 | Information system for indexing, search, storage and display control of linked data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710192532A CN100576209C (en) | 2007-12-07 | 2007-12-07 | Associated data index, retrieval, store and present the control information system constituting method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101178733A true CN101178733A (en) | 2008-05-14 |
| CN100576209C CN100576209C (en) | 2009-12-30 |
Family
ID=39404986
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710192532A Expired - Fee Related CN100576209C (en) | 2007-12-07 | 2007-12-07 | Associated data index, retrieval, store and present the control information system constituting method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN100576209C (en) |
| WO (1) | WO2009086730A1 (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009086730A1 (en) * | 2007-12-07 | 2009-07-16 | Haijie Peng | Information system for indexing, search, storage and display control of linked data |
| CN102831112A (en) * | 2011-06-14 | 2012-12-19 | 腾讯科技（深圳）有限公司 | Spatial index-based search result caching method and system |
| CN102841921A (en) * | 2012-06-30 | 2012-12-26 | 北京百度网讯科技有限公司 | Method and device for locating bus stop |
| CN103902604A (en) * | 2012-12-28 | 2014-07-02 | Ge医疗系统环球技术有限公司 | Method and device used for searching and displaying dispersive logs |
| CN106156294A (en) * | 2016-06-29 | 2016-11-23 | 福建富士通信息软件有限公司 | A kind of method of quick lookup associated data |
| CN107423267A (en) * | 2017-03-20 | 2017-12-01 | 广州视源电子科技股份有限公司 | The transmission of modification file, merging method and system based on cursor positioning |
| CN107682403A (en) * | 2017-09-07 | 2018-02-09 | 百度在线网络技术（北京）有限公司 | A kind of method, apparatus and equipment for being used to update UGC |
| CN109344263A (en) * | 2018-08-01 | 2019-02-15 | 昆明理工大学 | A kind of address matching method |
| CN110569398A (en) * | 2019-09-09 | 2019-12-13 | 广州虎牙科技有限公司 | data processing method and device, computer equipment and readable storage medium |
| CN113923209A (en) * | 2021-09-29 | 2022-01-11 | 北京轻舟智航科技有限公司 | Processing method for downloading batch data based on levelDB |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1300028A (en) * | 2001-01-31 | 2001-06-20 | 宇汇资讯股份有限公司 | Manugement and search method and system for dynamic attribute data base |
| KR20060053169A (en) * | 2004-10-09 | 2006-05-19 | 마이크로소프트 코포레이션 | Interaction of static and dynamic data sets |
| CN100576209C (en) * | 2007-12-07 | 2009-12-30 | 彭海杰 | Associated data index, retrieval, store and present the control information system constituting method |
-
2007
- 2007-12-07 CN CN200710192532A patent/CN100576209C/en not_active Expired - Fee Related
-
2009
- 2009-01-07 WO PCT/CN2008/001969 patent/WO2009086730A1/en active Application Filing
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009086730A1 (en) * | 2007-12-07 | 2009-07-16 | Haijie Peng | Information system for indexing, search, storage and display control of linked data |
| CN102831112A (en) * | 2011-06-14 | 2012-12-19 | 腾讯科技（深圳）有限公司 | Spatial index-based search result caching method and system |
| CN102831112B (en) * | 2011-06-14 | 2016-06-15 | 腾讯科技（深圳）有限公司 | A kind of Search Results caching method based on spatial index and system |
| CN102841921B (en) * | 2012-06-30 | 2016-07-13 | 北京百度网讯科技有限公司 | A kind of bus station localization method and device |
| CN102841921A (en) * | 2012-06-30 | 2012-12-26 | 北京百度网讯科技有限公司 | Method and device for locating bus stop |
| CN103902604B (en) * | 2012-12-28 | 2020-11-10 | Ge医疗系统环球技术有限公司 | Method and apparatus for searching and displaying scatter log |
| CN103902604A (en) * | 2012-12-28 | 2014-07-02 | Ge医疗系统环球技术有限公司 | Method and device used for searching and displaying dispersive logs |
| CN106156294A (en) * | 2016-06-29 | 2016-11-23 | 福建富士通信息软件有限公司 | A kind of method of quick lookup associated data |
| CN106156294B (en) * | 2016-06-29 | 2019-11-08 | 中电福富信息科技有限公司 | A kind of method of quick lookup associated data |
| CN107423267A (en) * | 2017-03-20 | 2017-12-01 | 广州视源电子科技股份有限公司 | The transmission of modification file, merging method and system based on cursor positioning |
| CN107423267B (en) * | 2017-03-20 | 2021-03-05 | 广州视源电子科技股份有限公司 | Method and system for transmitting and combining modified files based on cursor positioning |
| CN107682403A (en) * | 2017-09-07 | 2018-02-09 | 百度在线网络技术（北京）有限公司 | A kind of method, apparatus and equipment for being used to update UGC |
| CN109344263A (en) * | 2018-08-01 | 2019-02-15 | 昆明理工大学 | A kind of address matching method |
| CN109344263B (en) * | 2018-08-01 | 2022-07-19 | 昆明理工大学 | Address matching method |
| CN110569398A (en) * | 2019-09-09 | 2019-12-13 | 广州虎牙科技有限公司 | data processing method and device, computer equipment and readable storage medium |
| CN113923209A (en) * | 2021-09-29 | 2022-01-11 | 北京轻舟智航科技有限公司 | Processing method for downloading batch data based on levelDB |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100576209C (en) | 2009-12-30 |
| WO2009086730A1 (en) | 2009-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100576209C (en) | Associated data index, retrieval, store and present the control information system constituting method | |
| US10255377B2 (en) | Taxonomy driven site navigation | |
| US10719559B2 (en) | System for identifying, associating, searching and presenting documents based on time sequentialization | |
| Bozzon et al. | Liquid query: multi-domain exploratory search on the web | |
| US7526483B2 (en) | System and method for virtual folder sharing including utilization of static and dynamic lists | |
| KR101501462B1 (en) | Unified Data Object Management System and the Method | |
| US8775426B2 (en) | Interface to navigate and search a concept hierarchy | |
| US20210303529A1 (en) | Hierarchical structured data organization system | |
| JP2000090076A (en) | Method and system for managing document | |
| US10042898B2 (en) | Weighted metalabels for enhanced search in hierarchical abstract data organization systems | |
| CN105493075A (en) | Retrieval of attribute values based upon identified entities | |
| US11216516B2 (en) | Method and system for scalable search using microservice and cloud based search with records indexes | |
| CN104699742A (en) | Extreme visualization enabling extension for large data sets | |
| CN103310025A (en) | Unstructured-data description method and device | |
| CN108509437A (en) | A kind of ElasticSearch inquiries accelerated method | |
| CN113568995A (en) | Dynamic tile map making method based on retrieval conditions and tile map system | |
| KR20160053933A (en) | Smart search refinement | |
| CN111611304A (en) | Knowledge-driven joint big data query and analysis platform | |
| CN111611448A (en) | Knowledge-driven joint big data query and analysis platform | |
| CN112136121A (en) | Recommending secure content | |
| KR100796046B1 (en) | Method, terminal and system for providing hybrid-contents | |
| Liao et al. | Application study of information visualization in digital library | |
| Cheng et al. | Extensions of GAP‐tree and its implementation based on a non‐topological data model | |
| US9633028B2 (en) | Collaborative and personalized storage and search in hierarchical abstract data organization systems | |
| Amer-Yahia et al. | SOCLE: Towards a framework for data preparation in social applications. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091230 Termination date: 20151207 |
|
| EXPY | Termination of patent right or utility model |