WO2000036529A1 - Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases - Google Patents
Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases Download PDFInfo
- Publication number
- WO2000036529A1 WO2000036529A1 PCT/IT1999/000401 IT9900401W WO0036529A1 WO 2000036529 A1 WO2000036529 A1 WO 2000036529A1 IT 9900401 W IT9900401 W IT 9900401W WO 0036529 A1 WO0036529 A1 WO 0036529A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- process according
- cid
- concept
- concepts
- extension
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 97
- 238000007670 refining Methods 0.000 claims abstract description 12
- 230000000007 visual effect Effects 0.000 claims abstract description 4
- 238000012360 testing method Methods 0.000 claims description 20
- 239000013598 vector Substances 0.000 claims description 18
- 238000012217 deletion Methods 0.000 claims description 16
- 230000037430 deletion Effects 0.000 claims description 16
- YSCNMFDFYJUPEF-OWOJBTEDSA-N 4,4'-diisothiocyano-trans-stilbene-2,2'-disulfonic acid Chemical compound OS(=O)(=O)C1=CC(N=C=S)=CC=C1\C=C\C1=CC=C(N=C=S)C=C1S(O)(=O)=O YSCNMFDFYJUPEF-OWOJBTEDSA-N 0.000 claims description 15
- 230000014509 gene expression Effects 0.000 claims description 15
- 230000008859 change Effects 0.000 claims description 10
- 238000012544 monitoring process Methods 0.000 claims description 10
- 208000032577 susceptibility to 3 autoimmune disease Diseases 0.000 claims description 8
- 238000003780 insertion Methods 0.000 claims description 7
- 230000037431 insertion Effects 0.000 claims description 7
- 238000013507 mapping Methods 0.000 claims description 5
- 238000012986 modification Methods 0.000 claims description 5
- 230000004048 modification Effects 0.000 claims description 5
- 101100311240 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) STF1 gene Proteins 0.000 claims description 4
- 230000003139 buffering effect Effects 0.000 claims description 4
- 238000012545 processing Methods 0.000 claims description 4
- 208000032575 susceptibility to 2 autoimmune disease Diseases 0.000 claims description 4
- 238000004880 explosion Methods 0.000 claims description 3
- 230000015572 biosynthetic process Effects 0.000 claims description 2
- 230000003247 decreasing effect Effects 0.000 claims description 2
- 238000002372 labelling Methods 0.000 claims description 2
- 238000003786 synthesis reaction Methods 0.000 claims description 2
- 238000000605 extraction Methods 0.000 claims 2
- 230000008878 coupling Effects 0.000 claims 1
- 238000010168 coupling process Methods 0.000 claims 1
- 238000005859 coupling reaction Methods 0.000 claims 1
- 230000001131 transforming effect Effects 0.000 claims 1
- 208000036259 susceptibility to 4 autoimmune disease Diseases 0.000 description 5
- 230000006835 compression Effects 0.000 description 3
- 238000007906 compression Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 241000238876 Acari Species 0.000 description 1
- 101150105249 aes1 gene Proteins 0.000 description 1
- 238000005352 clarification Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000011045 prefiltration Methods 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/34—Browsing; Visualisation therefor
-
- 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/904—Browsing; Visualisation therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/332—Query formulation
- G06F16/3322—Query formulation using system suggestions
- G06F16/3323—Query formulation using system suggestions using document space presentation or visualization, e.g. category, hierarchy or range presentation and selection
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/953—Organization of data
- Y10S707/954—Relational
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99932—Access augmentation or optimizing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99937—Sorting
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99944—Object-oriented database structure
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99944—Object-oriented database structure
- Y10S707/99945—Object-oriented database structure processing
Definitions
- the present invention refers to a dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases.
- Dynamic taxonomies are a model to conceptually describe and access large heterogeneous information bases composed of texts, data, images and other multimedia documents.
- a dynamic taxonomy is basically a IS-A hierarchy of concepts, going from the most general (topmost) to the most specific. A concept may have several fathers. This is a conceptual schema of the information base, i.e. the "intension”. Documents can be freely classified under different concepts at different level of abstraction (this is the "extension”) . A specific document is generally classified under several concepts.
- Dynamic taxonomies enforce the IS-A relationship by containment, i.e. the documents classified under a concept C are the deep extension of C, i.e. the recursive union of all the documents classified under C and under each descendant C of C.
- concepts can be composed through classical boolean operations.
- any set S of documents in the universe of discourse U (defined as the set of all documents classified in the taxonomy) can be represented by a reduced taxonomy.
- S may be synthesized either by boolean expressions on concepts or by any other retrieval method (e.g. "information retrieval").
- the reduced taxonomy is derived from the original taxonomy by pruning the concepts (nodes) under which no document d in S is classified.
- a new visual query/browsing approach is supported by dynamic taxonomies.
- the user is initially presented with the complete taxonomy. He/she can then refine the result by selecting a subset of interest. Refinement is done by selecting concepts in the taxonomy and combining them through boolean operations. She/he will then be presented with a reduced taxonomy for the selected set of documents, which can be iteratively further refined.
- the taxonomy is usually a tree, but lattices (deriving from a concept having more than one father) are allowed. Documents can be classified under any (terminal or non-terminal) concept in the taxonomy. A specific document d in U may be classified under one or more concepts. The single, most general concept in the taxonomy is called the root of the taxonomy. This concept need not be usually stored in the extension, since it represents the entire corpus.
- C up (c) denotes the set ⁇ c union ⁇ c 1 : c' is an ancestor of c in the taxonomy, and c 1 is not the root of the taxonomy ⁇ .
- C up (c) is computed by the recursive application of operation AI03 (described hereinbelow) .
- C down (c) denotes the set (c union ⁇ c': c' is a descendant of c in the taxonomy ⁇ .
- C down (c) is computed by the recursive application of operation AI02 (described hereinbelow) .
- FIG. 1 a block diagram is shown of the main steps of the process of the present invention, from which all further developments of the process itself originate, such developments being described hereinbelow.
- the process for retrieving information on large heterogeneous data bases of the present invention comprises the steps of:
- brackets are omitted in the right part, square brackets are assumed.
- R [Al, ..., AN] -> [Bl, ..., BM] maps into R(A1, ..., AN, Bl, ..., BM)
- R [Al, ..., AN] - ⁇ Bl, ..., BM ⁇ maps into a set of 4 th NF relations Ri (Al, ..., AN, Bi) where underlined domains are key attributes of R.
- Abstract SQL queries on these relations will be used to express operations.
- [B] or [A] -i ⁇ B ⁇ will be used to denote the value or the set of values of B corresponding to a given value of A.
- Domain CID holds the abstract labels of concepts, i.e. stands for the set of values ⁇ CID(c), for all c in the taxonomy ⁇ .
- Domain DID holds the abstract labels of documents, i.e. denotes the set of values ⁇ DID(d), for all d in U ⁇ .
- Abstract structures to store the intension will now be described.
- the intension is the taxonomy itself; it can be seen as a conceptual schema for a set of corpora.
- the intension is stored as:
- AIS2 A language directory, identifying the appropriate dictionary relation for a specific "language” (required only if more than one "language” for concept description is used) in the form:
- LD [LANGUAGE_ID] -» D where LANGUAGE_ID holds the abstract identification of languages and D holds the existing dictionaries.
- AIS1' [CID, LANGUAGE_ID] -» textualLabel. AIS3. A father to son relation in the form
- the domain of SEQ is the set of natural numbers.
- the second form which is generally used, allows to supply a meaningful display order among the sons of a concept c.
- AIS4 A son to father relation, in the form SF: [CID] ⁇ > ⁇ FATHER_CID ⁇ storing, for each concept c, its fathers in the taxonomy.
- the domain FATHER_CID is the same as CID. If the taxonomy is not a lattice (i.e. any concept c can have no more than one father) , this relation becomes : SF: [CID] -» [FATHER_CID] .
- the extension represents the classification of documents. As such, it depends on the specific corpus.
- the extension is abstractly represented by the following three relations: AESl. Deep extension, in the form DE: [CID] -» ⁇ DID ⁇ storing, for each concept c, all the documents in its deep extension (that is, all the documents classified under c or under any descendant c' of c) .
- Classification in the form CL: [DID] -» ⁇ CID ⁇ storing, for each document, the most specific concepts under which it is classified. All the ancestors of these concepts can be easily recovered through the son-to-father (SF) relation in the intension.
- This structure is required only if the display of the classification for stored documents is supported at the user level.
- This storage structure is optional, since the set K of concepts under which a specific DID is stored can be synthesized by operation AE05 applied to each concept c in T on the singleton set ⁇ DID ⁇ . A concept c is then in K if and only if operation AE05 returns TRUE.
- Document directory in the form CL: [DID] -» ⁇ CID ⁇ storing, for each document, the most specific concepts under which it is classified. All the ancestors of these concepts can be easily recovered through the son-to-father (SF) relation in the intension.
- This structure is required only if the display of the classification for stored documents is supported at the user level
- Insert operations are performed by inserting the new concept C : in the dictionaries (AIS1)
- C is a son of another concept C, it may be useful to allow the user to reclassify under C some of the documents presently classified in the shallow extension of C.
- RecursiveDelete f, s
- s' is a son of s ⁇ call RecursiveDelete (s, s')
- UpdateDeepExtension (f) Changes in the taxonomy may be of three types:
- the set of DIDs for which the reduced taxonomy has to be produced can be generated by operations on the taxonomy and also by any other means, including, without loss of generality, database queries and information retrieval queries. Also, the current combination of concepts can be used as a pre-filter for other retrieval methods.
- the reduced taxonomy is usually produced on demand: the request only displays the highest levels in the tree.
- the set ⁇ DID ⁇ is kept in memory, so that when the explosion of a specific concept in the reduced taxonomy is requested, appropriate filtering is performed. 1. Produce the projection of ⁇ DID ⁇ for the root On the subsequent explosion of concept c: Produce the projection of ⁇ DID ⁇ for c
- the reduced tree can also be totally computed in a single step.
- RT be the set of concepts in the reduced tree.
- RT can be computed by testing, for each concept c in T, the membership of ⁇ DID ⁇ in c through operation AE03 or AE04 (if counters are required) .
- Concept c is in RT if and only if operation AE03 returns TRUE or operation AE04 returns a counter larger than 0.
- the computation can be speeded up in the following way:
- Boolean combinations of concepts are performed through the corresponding set operations on the deep extension of concepts. Let c and c' be two concepts, and DE(c) and DE(c') their deep extension (represented by AESl) :
- deletion is performed in the following way. For each concept c in T, if d belongs to the shallow extension of c:
- Changes in the classification of a document d are implemented in the following way. Let d be initially classified under a concept c (possibly null) and let the new concept under which d must be classified be c' (possibly null). If both c and c' are non-null, the operation means that d was previously classified under c and must now be classified under c'; if c is null, the operation means that d is additionally classified under c'; if c' is null, the operation means that the original classification under c must be removed. At least one of c and c' must be non-null. If c is not null:
- the most critical component is AESl (the deep extension) , for several reasons.
- deep-extension semantics are the natural semantics for boolean combinations of concepts (see AE08).
- any dbms or keyed access method can be used to provide storage for the deep extension, the set of documents in the deep extension can be more efficiently represented than by straightforwardly mapping the abstract relation.
- Set operations on the deep extension only involve logical operations on bit vectors (AND, OR, NOT, etc.). These operations take one or more bit vectors and produce a result bit vector of the same size .
- document id's be numbered 0 to
- Insertion, deletion and reclassification are also efficiently performed, by simply locating the appropriate deep and/or shallow extension and setting/resetting the appropriate bit.
- bit vectors by construction, the deep extension is very sparse at terminal level, and very dense at the top levels in the taxonomy.
- the use of any type of bit vector compression (such as, without prejudice to generality, Run Length Encoding (see Capon J. , "A probabilistic model for run-length coding of pictures", IEEE Trans, on Inf. Theory, 1959) and/or variable-length bit vectors) is therefore beneficial in reducing the overall storage overhead, although it introduces a compression/decompression overhead.
- Bloom filters see Bloom, B. H., Space/time tradeoffs in hash coding with allowable errors, Comm. of the ACM, 1970
- Bloom filters counting and set negation are usually not supported.
- Extension overhead for extensional structures is considerably larger. If the storage overhead prevents the complete storage of deep-extension structures, buffering strategies should be used, such as LRU or the ones described in documents Johnson, T., Shasha D. : 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm, Int. Conf. on Very Large Databases, 1994; and O'Neill, et al.: The LRU-K Page Replacement Algorithm For Database Disk Buffering, SIGMOD Conf. 1993. Shallow extensions and classification structures are less critical and may be kept on disk (again with the buffering strategies described in the two above-mentioned documents) .
- the membership test without counting can return TRUE when the first DID common to both lists is found, thereby speeding up the computation.
- Some data domains correspond usually to a concept (e.g. PRICE) which can be expanded into a large number of terminal concepts, each representing a specific value (e.g. 100$).
- PRICE a concept
- Such a representation causes a high number of son concepts, and increases the complexity of the taxonomy.
- values can be grouped by defining meaningful intervals of values and representing only the intervals as specific concepts. This representation loses the actual data, and presents the user with a fixed classification. Grouping may also be combined with exhaustive representation, but inherits most of the problems of both schemes.
- V2 Given a virtual concept v, retrieve its deep extension .
- V3 Given the son s of a virtual concept v, retrieve its deep extension.
- V Given a document d, find all the terminal concepts (descendants of v) under which it is stored.
- One way of implementing these abstract operations is by keeping, for each virtual concept v, two abstract relations: S v : [value] -> ⁇ DID ⁇ which stores the set of documents with a given value in the domain of values of the virtual concept .
- C v [DID] -> ⁇ value ⁇ which stores the set of values for a specific document; if each document has a single value C v : [DID] -> [value] .
- a single C v relation may store multiple domains and be shared by many virtual concepts: in this case C v : [DID] -> ⁇ valueA, ..., valueN ⁇ , where valuel denotes the set of values for domain I. It is important to note that neither S v nor C v need to be explicitly stored, but they can be also synthesized by queries on external data.
- V2 Given a virtual concept v, retrieve its deep extension: SELECT DISTINCT DID FROM C v
- V4 Given a document d, find all the terminal concepts (descendants of v) under which it is stored
- a virtual concept v can be organized into a sub-taxonomy, i.e. each nonterminal son of v represents a set of actual domain values. Each son may be further specialized, and so on.
- SALARY can be organized into the following taxonomy: SALARY
- the non-terminal descendants of v can be stored as derived virtual concepts, i.e. virtual concepts referencing the same abstract relations defined for v, but providing additional restrictions.
- "Low” can be characterized by the additional restriction value ⁇ 1000, so that operation V3 for Low becomes: SELECT DISTINCT DID FROM C v WHERE value ⁇ 1000
- AIS5 [CID] -> [conceptType] where conceptType designated real, simple virtual and derived virtual concepts.
- AIS8 [CID]- [CID' , restriction] for derived virtual concepts only, identifies the virtual concept to refer to and the additional restriction.
- Time-varying concepts can be represented by a simple variant of virtual concepts.
- a time instant t is represented as an abstract "timestamp".
- the timestamp contains the number of clock ticks starting from a fixed time origin; the clock resolution depends on the application. All timestamps use the same time coordinates.
- the difference between two timestamps t and t' defines the time interval amplitude between the two times.
- the values of the time-varying concept can be split into N intervals (from more recent to older), which are stored as real concepts.
- N intervals from more recent to older
- a classification criterion e.g. T-value less than 1 week and no smaller than 1 day
- the present invention allows to use a dynamic taxonomy to browse and retrieve data stored in a conventional dbms (relational, object-relational, object-oriented, etc.).
- the invention covers data stored as a single relation (or object) or, more generally, represented by a single view on the database (see Elmasri, Navathe, Fundamentals of database systems, The Benjamin/Cummings Publ . Co., 1994) .
- documents correspond to tuples (or rows, records, objects) in the view V.
- DID document identifier
- PK represents the primary key of the relation.
- DK is used to access a tuple of V, given a document id DID
- IDK is used to retrieve the document id corresponding to a specific value it the primary key of V. This latter representation is beneficial when primary keys PK's are large (e.g. when they are defined on alphanumeric attributes) .
- V Given a view V we can construct a taxonomy for V in the following way. For each attribute A in V, we place a corresponding concept C (A) (either a real or a virtual one) as an immediate son of the root. Virtual concepts use V itself for the synthesis of sons and extensions (as previously seen) . Real concepts can be further specialized as required by the semantics of A.
- the boolean clause B(C, t) may reference any attribute of t, and consequently, new virtual concepts (called “extended concepts") may be defined on combinations of attributes by operations on the database (including but not restricted to sums, averages, etc. of database values).
- the designer may define new concepts either as taxonomic generalizations of attributes or extended concepts.
- New concepts may be derived either as real or virtual concepts by operations on the database (including but not restricted to sums, averages, etc. of database values). Binding is then performed in the following way. Virtual concepts do not require any special processing, since they are realized by operations on the database. Real concepts require a classification for any new tuple, a deletion if t is deleted or a reclassification if t is changed. In order to classify t, the system locates the set
- NAME is represented in the same way.
- Sv [COUNTRY] -» ⁇ OWNID ⁇ Cv: [TOWNID] -> [COUNTRY] POPULATION is represented in an analogous way.
- the invention consists in using set-theoretic expressions on concepts (plus optional, additional expressions, such as information retrieval queries) to describe user interest in specific topics. Such expressions may be directly entered by the user or transparently and automatically captured by the system, by monitoring user query/browsing.
- the specification of user profiles is especially important in electronic commerce and information brokering and in monitoring dynamic data sources in order to advise users of new or changed relevant information.
- the information base is assumed to be classified through dynamic taxonomies.
- the scenario is as follows. Several users express their interests through possible multiple conceptual expressions, called "interest specifications”. A monitoring system accepts these requests (with an abstract user "address” to send alerts to) . The monitoring system also monitors an information base for changes (insertion, deletion, change) . The information base is described by the same taxonomy used by users to express their interests.
- the system When a change occurs in the information base (the type of change to be alerted for may be specified by users) , the system must find the users to alert on the basis of their interests.
- Additional expressions such as information retrieval queries, will usually be composed by AND with taxonomic expressions, and can therefore be solved, if required, after the corresponding taxonomic expression is satisfied.
- K be the set of concepts used to classify document d.
- SID(k) be the list of specifications for k (accessible through relation SI) ordered by increasing specification id's.
- MergeCount (K) as the set composed of pairs (SID, N) such that SID is in MergeCount (K) if SID belongs to a SID(k), k in K. If the pair (SID, N) is in MergeCount (K) , N counts the number of SID(k) referencing SID.
- MergeCount (K) can be produced at a linear cost, by merging the SID(k) lists.
- S represented by SID(S)
- SIDi(S) the i-th component of S.
- SCD [COMPONENT] -- [SDI, N] , where COMPONENT stores components of specifications, COMPONENT .
- SDI represents the specification id of the specification S of which COMPONENT is a component, and COMPONENT.
- N is the number of concepts referenced in the component.
- the specification inversion is stored as: SI: [CID] - ⁇ COMPONENT ⁇ , where CID is a concept identifier and CID. COMPONENT is the set of components referencing the concept identified by CID.
- K be the set of concepts used to classify document d, for each concept k in K, let COMPONENT (k) be the list of components for k (accessible through relation SI) ordered by increasing component id's.
- ComponentMergeCount (K) as the set composed of pairs (COMPONENT, N) such that COMPONENT is in ComponentMergeCount (K) if COMPONENT belongs to a COMPONENT ( k) , k in K. If the pair (COMPONENT, N) is in ComponentMergeCount (K) , N counts the number of COMPONENT (k) referencing COMPONENT.
- ComponentMergeCount (K) can be produced at a linear cost, by merging the COMPONENT (k) lists.
- C is a non-terminal concept: for each k in C down (C) CI D ( k) .
- S I D CI D ( k) .
- S I D union Z , i f Z is a specification
- the set S of satisfied specifications is computed as per the previous cases.
- the above-disclosed techniques allow computing the specifications satisfied by a document d.
- the above-disclosed techniques can be applied in two ways. In the first way, the techniques are applied without modifications to every document d in D, then removing possible duplicate specifications. In the second way, K is defined as the set of concepts used to classify D, the adequate technique is chosen among the described ones and the set S of "candidate" specifications is determined. Every specification s in S is then checked, performing it on D.
Abstract
Description
Claims
Priority Applications (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/868,339 US6763349B1 (en) | 1998-12-16 | 1999-12-03 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
EP99961274A EP1141866A1 (en) | 1998-12-16 | 1999-12-03 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
AU17965/00A AU1796500A (en) | 1998-12-16 | 1999-12-03 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
US10/819,946 US7340451B2 (en) | 1998-12-16 | 2004-04-08 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
US12/023,719 US7778993B2 (en) | 1998-12-16 | 2008-01-31 | Dynamic Taxonomy process for browsing and retrieving information in large heterogeneous data bases |
US12/829,249 US8041699B2 (en) | 1998-12-16 | 2010-07-01 | Process of dynamic taxonomy for browsing and retrieving information in large heterogeneous data bases |
US13/180,196 US8650171B2 (en) | 1998-12-16 | 2011-07-11 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
US14/150,982 US20140129547A1 (en) | 1998-12-16 | 2014-01-09 | Dynamic Taxonomy for Browsing and Retrieving Information in Large Heterogeneous data bases |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
ITTO98A001049 | 1998-12-16 | ||
IT1998TO001049A IT1303603B1 (en) | 1998-12-16 | 1998-12-16 | DYNAMIC TAXONOMY PROCEDURE FOR FINDING INFORMATION ON LARGE HETEROGENEOUS DATABASES. |
Related Child Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/868,339 A-371-Of-International US6763349B1 (en) | 1998-12-16 | 1999-12-03 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
US09868339 A-371-Of-International | 1999-12-03 | ||
US10/819,946 Continuation US7340451B2 (en) | 1998-12-16 | 2004-04-08 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000036529A1 true WO2000036529A1 (en) | 2000-06-22 |
Family
ID=11417250
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IT1999/000401 WO2000036529A1 (en) | 1998-12-16 | 1999-12-03 | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases |
Country Status (5)
Country | Link |
---|---|
US (6) | US6763349B1 (en) |
EP (1) | EP1141866A1 (en) |
AU (1) | AU1796500A (en) |
IT (1) | IT1303603B1 (en) |
WO (1) | WO2000036529A1 (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002008946A2 (en) * | 2000-07-24 | 2002-01-31 | Protigen, Inc. | A method and system for a document search system using search criteria comprised of ratings prepared by experts |
WO2002056204A2 (en) * | 2000-12-08 | 2002-07-18 | Professorq, Inc. | Natural query interface based on concept selection |
WO2004057491A1 (en) * | 2002-12-20 | 2004-07-08 | Redbank Manor Pty Ltd | Search engine result reporter |
US6839699B2 (en) | 2000-12-08 | 2005-01-04 | Wayne Chan | Natural query interface based on concept selection |
US7058516B2 (en) | 2000-06-30 | 2006-06-06 | Bioexpertise, Inc. | Computer implemented searching using search criteria comprised of ratings prepared by leading practitioners in biomedical specialties |
US7062483B2 (en) | 2000-05-18 | 2006-06-13 | Endeca Technologies, Inc. | Hierarchical data-driven search and navigation system and method for information retrieval |
US7548899B1 (en) | 2000-12-08 | 2009-06-16 | Del Favero Jr John P | Method and system for information retrieval based on menu selections |
FR3051936A1 (en) * | 2016-05-31 | 2017-12-01 | Orange | METHOD AND DEVICE FOR CLASSIFYING MULTIMEDIA CONTENT, TERMINAL AND CORRESPONDING COMPUTER PROGRAM |
Families Citing this family (101)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
IT1303603B1 (en) | 1998-12-16 | 2000-11-14 | Giovanni Sacco | DYNAMIC TAXONOMY PROCEDURE FOR FINDING INFORMATION ON LARGE HETEROGENEOUS DATABASES. |
US7925610B2 (en) * | 1999-09-22 | 2011-04-12 | Google Inc. | Determining a meaning of a knowledge item using document-based information |
US8051104B2 (en) | 1999-09-22 | 2011-11-01 | Google Inc. | Editing a network of interconnected concepts |
US8914361B2 (en) | 1999-09-22 | 2014-12-16 | Google Inc. | Methods and systems for determining a meaning of a document to match the document to content |
JP2004501421A (en) * | 2000-03-27 | 2004-01-15 | ドキュメンタム,インコーポレイティド | Method and apparatus for generating metadata for documents |
US7424445B1 (en) * | 2000-04-06 | 2008-09-09 | Apple Inc. | Virtual bundles |
US7526437B1 (en) * | 2000-04-06 | 2009-04-28 | Apple Inc. | Custom stores |
US7035864B1 (en) * | 2000-05-18 | 2006-04-25 | Endeca Technologies, Inc. | Hierarchical data-driven navigation system and method for information retrieval |
US7617184B2 (en) * | 2000-05-18 | 2009-11-10 | Endeca Technologies, Inc. | Scalable hierarchical data-driven navigation system and method for information retrieval |
US7325201B2 (en) * | 2000-05-18 | 2008-01-29 | Endeca Technologies, Inc. | System and method for manipulating content in a hierarchical data-driven search and navigation system |
US20030120630A1 (en) * | 2001-12-20 | 2003-06-26 | Daniel Tunkelang | Method and system for similarity search and clustering |
US7650327B2 (en) * | 2002-03-01 | 2010-01-19 | Marine Biological Laboratory | Managing taxonomic information |
US20040117366A1 (en) * | 2002-12-12 | 2004-06-17 | Ferrari Adam J. | Method and system for interpreting multiple-term queries |
US20050038781A1 (en) * | 2002-12-12 | 2005-02-17 | Endeca Technologies, Inc. | Method and system for interpreting multiple-term queries |
US7047236B2 (en) * | 2002-12-31 | 2006-05-16 | International Business Machines Corporation | Method for automatic deduction of rules for matching content to categories |
WO2004097759A1 (en) * | 2003-04-25 | 2004-11-11 | Apple Computer, Inc. | Method and system for network-based purchase and distribution of media |
US9406068B2 (en) | 2003-04-25 | 2016-08-02 | Apple Inc. | Method and system for submitting media for network-based purchase and distribution |
EP2357623A1 (en) | 2003-04-25 | 2011-08-17 | Apple Inc. | Graphical user interface for browsing, searching and presenting media items |
EP1496452A1 (en) * | 2003-07-10 | 2005-01-12 | Comptel Corporation | Method and computer program product for classification and linking data records, and a classification system |
US20050044487A1 (en) * | 2003-08-21 | 2005-02-24 | Apple Computer, Inc. | Method and apparatus for automatic file clustering into a data-driven, user-specific taxonomy |
US7689536B1 (en) * | 2003-12-18 | 2010-03-30 | Google Inc. | Methods and systems for detecting and extracting information |
US20050219929A1 (en) * | 2004-03-30 | 2005-10-06 | Navas Julio C | Method and apparatus achieving memory and transmission overhead reductions in a content routing network |
US7310637B2 (en) * | 2004-05-05 | 2007-12-18 | International Business Machines Corporation | Dynamic database access via standard query language and abstraction technology |
US7606791B2 (en) * | 2004-06-03 | 2009-10-20 | International Business Machines Corporation | Internal parameters (parameters aging) in an abstract query |
ATE535778T1 (en) * | 2004-07-23 | 2011-12-15 | Decarta Inc | AUTOMATIC PRIORITIZATION OF MAP OBJECTS |
US20080215313A1 (en) * | 2004-08-13 | 2008-09-04 | Swiss Reinsurance Company | Speech and Textual Analysis Device and Corresponding Method |
US20060074980A1 (en) * | 2004-09-29 | 2006-04-06 | Sarkar Pte. Ltd. | System for semantically disambiguating text information |
US8332421B2 (en) * | 2004-10-06 | 2012-12-11 | Pierre Grossmann | Automated user-friendly click-and-search system and method for helping business and industries in foreign countries using preferred taxonomies for formulating queries to search on a computer network and for finding relevant industrial information about products and services in each industrial group, and media for providing qualified industrial sales leads |
US7555472B2 (en) * | 2005-09-02 | 2009-06-30 | The Board Of Trustees Of The University Of Illinois | Identifying conceptual gaps in a knowledge base |
US7788582B2 (en) * | 2005-09-06 | 2010-08-31 | Apple Inc. | Techniques and graphical user interfaces for improved media item searching |
US8688673B2 (en) * | 2005-09-27 | 2014-04-01 | Sarkar Pte Ltd | System for communication and collaboration |
US7493317B2 (en) * | 2005-10-20 | 2009-02-17 | Omniture, Inc. | Result-based triggering for presentation of online content |
JP4581962B2 (en) * | 2005-10-27 | 2010-11-17 | 株式会社日立製作所 | Information retrieval system, index management method and program |
US8019752B2 (en) | 2005-11-10 | 2011-09-13 | Endeca Technologies, Inc. | System and method for information retrieval from object collections with complex interrelationships |
US20070136335A1 (en) * | 2005-12-09 | 2007-06-14 | Robert Dionne | Method and system for multiple independent extensions of a concept taxonomy via description logic classification |
US7774708B2 (en) * | 2006-01-04 | 2010-08-10 | Apple Inc. | Graphical user interface with improved media presentation |
US20070185860A1 (en) * | 2006-01-24 | 2007-08-09 | Michael Lissack | System for searching |
US20080016093A1 (en) * | 2006-07-11 | 2008-01-17 | Clement Lambert Dickey | Apparatus, system, and method for subtraction of taxonomic elements |
US7788599B2 (en) * | 2006-07-28 | 2010-08-31 | Apple Inc. | User interface elements for hierarchical selection of items |
US8689254B2 (en) * | 2006-09-11 | 2014-04-01 | Apple Inc. | Techniques and graphical user interfaces for preview of media items |
US8533602B2 (en) | 2006-10-05 | 2013-09-10 | Adobe Systems Israel Ltd. | Actionable reports |
US7644068B2 (en) * | 2006-10-06 | 2010-01-05 | International Business Machines Corporation | Selecting records from a list with privacy protections |
US20110307477A1 (en) * | 2006-10-30 | 2011-12-15 | Semantifi, Inc. | Method and apparatus for dynamic grouping of unstructured content |
US7930313B1 (en) | 2006-11-22 | 2011-04-19 | Adobe Systems Incorporated | Controlling presentation of refinement options in online searches |
US8676802B2 (en) | 2006-11-30 | 2014-03-18 | Oracle Otc Subsidiary Llc | Method and system for information retrieval with clustering |
US7552114B2 (en) | 2007-03-07 | 2009-06-23 | International Business Machines Corporation | System, and method for interactive browsing |
US8117162B2 (en) * | 2007-03-21 | 2012-02-14 | International Business Machines Corporation | Determining which user files to backup in a backup system |
US8126863B2 (en) | 2007-10-25 | 2012-02-28 | Apple Inc. | Search control combining classification and text-based searching techniques |
US20090119572A1 (en) * | 2007-11-02 | 2009-05-07 | Marja-Riitta Koivunen | Systems and methods for finding information resources |
US7856434B2 (en) | 2007-11-12 | 2010-12-21 | Endeca Technologies, Inc. | System and method for filtering rules for manipulating search results in a hierarchical search and navigation system |
US8812366B2 (en) * | 2008-09-30 | 2014-08-19 | Bank Of America Corporation | Automatic generation of change orders |
US8533156B2 (en) | 2008-01-04 | 2013-09-10 | Apple Inc. | Abstraction for representing an object irrespective of characteristics of the object |
WO2009111631A1 (en) * | 2008-03-05 | 2009-09-11 | Chacha Search, Inc. | Method and system for triggering a search request |
US8326847B2 (en) * | 2008-03-22 | 2012-12-04 | International Business Machines Corporation | Graph search system and method for querying loosely integrated data |
US8306971B2 (en) * | 2008-06-20 | 2012-11-06 | Tableau Software, Inc. | Methods and systems of automatically geocoding a dataset for visual analysis |
US8788476B2 (en) * | 2008-08-15 | 2014-07-22 | Chacha Search, Inc. | Method and system of triggering a search request |
US8229816B1 (en) | 2008-09-25 | 2012-07-24 | Bank Of America Corporation | Intelligent cash recycler remote capabilities |
US20100082483A1 (en) * | 2008-09-30 | 2010-04-01 | Bank Of America Corporation | Automatic Generation of Change Orders |
US8805846B2 (en) * | 2008-09-30 | 2014-08-12 | Apple Inc. | Methods and systems for providing easy access to information and for sharing services |
US8734872B2 (en) * | 2008-09-30 | 2014-05-27 | Apple Inc. | Access control to content published by a host |
US9703831B2 (en) * | 2008-12-22 | 2017-07-11 | Apple Inc. | Contextual display of saved search queries |
US20100241639A1 (en) * | 2009-03-20 | 2010-09-23 | Yahoo! Inc. | Apparatus and methods for concept-centric information extraction |
US8694535B2 (en) | 2009-03-21 | 2014-04-08 | Matthew Oleynik | Systems and methods for research database management |
US8838628B2 (en) * | 2009-04-24 | 2014-09-16 | Bonnie Berger Leighton | Intelligent search tool for answering clinical queries |
WO2011080775A1 (en) | 2009-12-30 | 2011-07-07 | Telecom Italia S.P.A. | Method and system for carrying out searches in a database |
US20110225550A1 (en) * | 2010-03-12 | 2011-09-15 | Creedon Michael S | System and method for displaying and navigating library information with a virtual library collections browser |
US8548989B2 (en) * | 2010-07-30 | 2013-10-01 | International Business Machines Corporation | Querying documents using search terms |
US8566324B1 (en) * | 2010-09-12 | 2013-10-22 | Giovanni M Sacco | Inverted index and inverted list process for storing and retrieving information |
US8533225B2 (en) * | 2010-09-27 | 2013-09-10 | Google Inc. | Representing and processing inter-slot constraints on component selection for dynamic ads |
US10380269B2 (en) * | 2011-06-07 | 2019-08-13 | Entit Software Llc | Sideways information passing |
WO2012174640A1 (en) * | 2011-06-22 | 2012-12-27 | Rogers Communications Inc. | Systems and methods for creating an interest profile for a user |
US9201964B2 (en) | 2012-01-23 | 2015-12-01 | Microsoft Technology Licensing, Llc | Identifying related entities |
US9081854B2 (en) * | 2012-07-06 | 2015-07-14 | Hewlett-Packard Development Company, L.P. | Multilabel classification by a hierarchy |
CN104541267A (en) * | 2012-08-29 | 2015-04-22 | 惠普发展公司,有限责任合伙企业 | Querying structured and unstructured databases |
US8874553B2 (en) | 2012-08-30 | 2014-10-28 | Wal-Mart Stores, Inc. | Establishing “is a” relationships for a taxonomy |
US9460135B2 (en) * | 2012-12-18 | 2016-10-04 | Webtrends Inc. | Methods and automated systems for testing, optimization, and analysis that use robust statistical processing of non-binomial experimental results |
US10540373B1 (en) * | 2013-03-04 | 2020-01-21 | Jpmorgan Chase Bank, N.A. | Clause library manager |
US9361407B2 (en) | 2013-09-06 | 2016-06-07 | Sap Se | SQL extended with transient fields for calculation expressions in enhanced data models |
US9430523B2 (en) | 2013-09-06 | 2016-08-30 | Sap Se | Entity-relationship model extensions using annotations |
US9619552B2 (en) | 2013-09-06 | 2017-04-11 | Sap Se | Core data services extensibility for entity-relationship models |
US9575819B2 (en) | 2013-09-06 | 2017-02-21 | Sap Se | Local buffers for event handlers |
US9354948B2 (en) | 2013-09-06 | 2016-05-31 | Sap Se | Data models containing host language embedded constraints |
US9442977B2 (en) | 2013-09-06 | 2016-09-13 | Sap Se | Database language extended to accommodate entity-relationship models |
US9639572B2 (en) | 2013-09-06 | 2017-05-02 | Sap Se | SQL enhancements simplifying database querying |
US9176801B2 (en) | 2013-09-06 | 2015-11-03 | Sap Se | Advanced data models containing declarative and programmatic constraints |
US10096040B2 (en) | 2014-01-31 | 2018-10-09 | Walmart Apollo, Llc | Management of the display of online ad content consistent with one or more performance objectives for a webpage and/or website |
US10878017B1 (en) * | 2014-07-29 | 2020-12-29 | Groupon, Inc. | System and method for programmatic generation of attribute descriptors |
US9613371B2 (en) | 2014-09-02 | 2017-04-04 | Wal-Mart Stores, Inc. | Dynamic taxonomy generation with demand-based product groups |
US9697276B2 (en) | 2014-12-29 | 2017-07-04 | International Business Machines Corporation | Large taxonomy categorization |
US10467215B2 (en) | 2015-06-23 | 2019-11-05 | Microsoft Technology Licensing, Llc | Matching documents using a bit vector search index |
US10565198B2 (en) | 2015-06-23 | 2020-02-18 | Microsoft Technology Licensing, Llc | Bit vector search index using shards |
US11281639B2 (en) | 2015-06-23 | 2022-03-22 | Microsoft Technology Licensing, Llc | Match fix-up to remove matching documents |
US10733164B2 (en) | 2015-06-23 | 2020-08-04 | Microsoft Technology Licensing, Llc | Updating a bit vector search index |
US10242071B2 (en) | 2015-06-23 | 2019-03-26 | Microsoft Technology Licensing, Llc | Preliminary ranker for scoring matching documents |
US11392568B2 (en) | 2015-06-23 | 2022-07-19 | Microsoft Technology Licensing, Llc | Reducing matching documents for a search query |
US10229143B2 (en) | 2015-06-23 | 2019-03-12 | Microsoft Technology Licensing, Llc | Storage and retrieval of data from a bit vector search index |
US20170177641A1 (en) * | 2015-12-19 | 2017-06-22 | Viktor Charles Von Drakk | Method and device for correlating multiple tables in a database environment |
US10296913B1 (en) * | 2016-03-23 | 2019-05-21 | Emc Corporation | Integration of heterogenous data using omni-channel ontologies |
CN107038179B (en) * | 2016-08-23 | 2020-04-10 | 平安科技(深圳)有限公司 | Information item storage method and system |
US10922299B2 (en) | 2018-04-24 | 2021-02-16 | The Von Drakk Corporation | Correlating multiple tables in a non-relational database environment |
EP3739491B1 (en) | 2019-05-17 | 2022-07-06 | Samsung Electronics Co., Ltd. | Electronic apparatus and controlling method thereof |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0694829A1 (en) * | 1994-07-28 | 1996-01-31 | Xerox Corporation | A method and apparatus for visualization of database search results |
US5644740A (en) * | 1992-12-02 | 1997-07-01 | Hitachi, Ltd. | Method and apparatus for displaying items of information organized in a hierarchical structure |
Family Cites Families (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3757037A (en) * | 1972-02-02 | 1973-09-04 | N Bialek | Video image retrieval catalog system |
US4768144A (en) * | 1983-10-25 | 1988-08-30 | Keycom Electronic Publishing, Inc. | Method and apparatus for retrieving information distributed over nonconsecutive pages |
US4879648A (en) * | 1986-09-19 | 1989-11-07 | Nancy P. Cochran | Search system which continuously displays search terms during scrolling and selections of individually displayed data sets |
US4992940A (en) * | 1989-03-13 | 1991-02-12 | H-Renee, Incorporated | System and method for automated selection of equipment for purchase through input of user desired specifications |
US5283865A (en) * | 1989-10-13 | 1994-02-01 | Clear With Computers, Inc. | Computer-assisted parts sales system |
US5201047A (en) | 1989-12-21 | 1993-04-06 | International Business Machines Corporation | Attribute-based classification and retrieval system |
US5493490A (en) * | 1992-05-05 | 1996-02-20 | Clear With Computers, Inc. | Electronic proposal preparation system for selling vehicles |
US5539870A (en) | 1992-10-05 | 1996-07-23 | International Business Machines Corporation | Computerized system and process for interactively managing a distributed database system |
WO1994012944A1 (en) * | 1992-11-23 | 1994-06-09 | Paragon Concepts, Inc. | Computer filing system with user selected categories to provide file access |
CA2095452C (en) | 1993-05-04 | 1997-03-18 | Phillip J. Beaudet | Dynamic hierarchical selection menu |
US5713020A (en) | 1993-09-02 | 1998-01-27 | Microsoft Corporation | Method and system for generating database queries containing multiple levels of aggregation |
US5715444A (en) * | 1994-10-14 | 1998-02-03 | Danish; Mohamed Sherif | Method and system for executing a guided parametric search |
US5692177A (en) * | 1994-10-26 | 1997-11-25 | Microsoft Corporation | Method and system for data set storage by iteratively searching for perfect hashing functions |
US5758257A (en) * | 1994-11-29 | 1998-05-26 | Herz; Frederick | System and method for scheduling broadcast of and access to video programs and other data using customer profiles |
US5616342A (en) | 1995-04-11 | 1997-04-01 | Pdt, Inc. | Emulsioin suitable for administering a poorly water-soluble photosensitizing compound and use thereof |
US5970471A (en) * | 1996-03-22 | 1999-10-19 | Charles E. Hill & Associates, Inc. | Virtual catalog and product presentation method and apparatus |
US5768581A (en) | 1996-05-07 | 1998-06-16 | Cochran; Nancy Pauline | Apparatus and method for selecting records from a computer database by repeatedly displaying search terms from multiple list identifiers before either a list identifier or a search term is selected |
US5727129A (en) | 1996-06-04 | 1998-03-10 | International Business Machines Corporation | Network system for profiling and actively facilitating user activities |
US6374275B2 (en) | 1997-06-11 | 2002-04-16 | Scientific-Atlanta, Inc. | System, method, and media for intelligent selection of searching terms in a keyboardless entry environment |
US6128617A (en) | 1997-11-24 | 2000-10-03 | Lowry Software, Incorporated | Data display software with actions and links integrated with information |
US6297824B1 (en) * | 1997-11-26 | 2001-10-02 | Xerox Corporation | Interactive interface for viewing retrieval results |
US6567814B1 (en) * | 1998-08-26 | 2003-05-20 | Thinkanalytics Ltd | Method and apparatus for knowledge discovery in databases |
US6366910B1 (en) * | 1998-12-07 | 2002-04-02 | Amazon.Com, Inc. | Method and system for generation of hierarchical search results |
IT1303603B1 (en) | 1998-12-16 | 2000-11-14 | Giovanni Sacco | DYNAMIC TAXONOMY PROCEDURE FOR FINDING INFORMATION ON LARGE HETEROGENEOUS DATABASES. |
-
1998
- 1998-12-16 IT IT1998TO001049A patent/IT1303603B1/en active IP Right Grant
-
1999
- 1999-12-03 AU AU17965/00A patent/AU1796500A/en not_active Abandoned
- 1999-12-03 WO PCT/IT1999/000401 patent/WO2000036529A1/en not_active Application Discontinuation
- 1999-12-03 EP EP99961274A patent/EP1141866A1/en not_active Withdrawn
- 1999-12-03 US US09/868,339 patent/US6763349B1/en not_active Expired - Fee Related
-
2004
- 2004-04-08 US US10/819,946 patent/US7340451B2/en not_active Expired - Fee Related
-
2008
- 2008-01-31 US US12/023,719 patent/US7778993B2/en not_active Expired - Fee Related
-
2010
- 2010-07-01 US US12/829,249 patent/US8041699B2/en not_active Expired - Fee Related
-
2011
- 2011-07-11 US US13/180,196 patent/US8650171B2/en not_active Expired - Fee Related
-
2014
- 2014-01-09 US US14/150,982 patent/US20140129547A1/en not_active Abandoned
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5644740A (en) * | 1992-12-02 | 1997-07-01 | Hitachi, Ltd. | Method and apparatus for displaying items of information organized in a hierarchical structure |
EP0694829A1 (en) * | 1994-07-28 | 1996-01-31 | Xerox Corporation | A method and apparatus for visualization of database search results |
Non-Patent Citations (3)
Title |
---|
GERT SCHMELTZ PEDERSEN: "A BROWSER FOR BIBLIOGRAPHIC INFORMATION RETRIEVAL, BASED ON AN APPLICATION OF LATTICE THEORY", PROCEEDINGS OF THE ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL,US,NEW YORK, ACM, vol. CONF. 16, 1993, pages 270 - 279, XP000463837 * |
HEARST M A ET AL: "CAT-A-CONE: AN INTERACTIVE INTERFACE FOR SPECIFYING SEARCHED AND VIEWING RETRIEVAL RESULTS USING A LARGE CATEGORY HIERARCHY", ANNUAL INTERNATIONAL ACM-SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL,US,NEW YORK, NY: ACM, 1997, pages 246 - 255, XP000782010, ISBN: 0-89791-836-3 * |
STORY G A ET AL: "THE RIGHTPAGES IMAGE-BASED ELECTRONIC LIBRARY FOR ALERTING AND BROWSING", COMPUTER,US,IEEE COMPUTER SOCIETY, LONG BEACH., CA, US, vol. 25, no. 9, 1 September 1992 (1992-09-01), pages 17 - 25, XP000309581, ISSN: 0018-9162 * |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7062483B2 (en) | 2000-05-18 | 2006-06-13 | Endeca Technologies, Inc. | Hierarchical data-driven search and navigation system and method for information retrieval |
US7058516B2 (en) | 2000-06-30 | 2006-06-06 | Bioexpertise, Inc. | Computer implemented searching using search criteria comprised of ratings prepared by leading practitioners in biomedical specialties |
WO2002008946A2 (en) * | 2000-07-24 | 2002-01-31 | Protigen, Inc. | A method and system for a document search system using search criteria comprised of ratings prepared by experts |
WO2002008946A3 (en) * | 2000-07-24 | 2004-04-01 | Protigen Inc | A method and system for a document search system using search criteria comprised of ratings prepared by experts |
WO2002056204A2 (en) * | 2000-12-08 | 2002-07-18 | Professorq, Inc. | Natural query interface based on concept selection |
WO2002056204A3 (en) * | 2000-12-08 | 2003-08-28 | Professorq Inc | Natural query interface based on concept selection |
US6839699B2 (en) | 2000-12-08 | 2005-01-04 | Wayne Chan | Natural query interface based on concept selection |
US7548899B1 (en) | 2000-12-08 | 2009-06-16 | Del Favero Jr John P | Method and system for information retrieval based on menu selections |
WO2004057491A1 (en) * | 2002-12-20 | 2004-07-08 | Redbank Manor Pty Ltd | Search engine result reporter |
FR3051936A1 (en) * | 2016-05-31 | 2017-12-01 | Orange | METHOD AND DEVICE FOR CLASSIFYING MULTIMEDIA CONTENT, TERMINAL AND CORRESPONDING COMPUTER PROGRAM |
Also Published As
Publication number | Publication date |
---|---|
US20140129547A1 (en) | 2014-05-08 |
EP1141866A1 (en) | 2001-10-10 |
US20080133490A1 (en) | 2008-06-05 |
US8041699B2 (en) | 2011-10-18 |
ITTO981049A1 (en) | 1999-03-16 |
IT1303603B1 (en) | 2000-11-14 |
US7778993B2 (en) | 2010-08-17 |
AU1796500A (en) | 2000-07-03 |
US6763349B1 (en) | 2004-07-13 |
US8650171B2 (en) | 2014-02-11 |
US20100274809A1 (en) | 2010-10-28 |
US20040193593A1 (en) | 2004-09-30 |
US7340451B2 (en) | 2008-03-04 |
US20110270878A1 (en) | 2011-11-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6763349B1 (en) | Dynamic taxonomy process for browsing and retrieving information in large heterogeneous data bases | |
Zobel et al. | Inverted files versus signature files for text indexing | |
Sacks-Davis et al. | Multikey access methods based on superimposed coding techniques | |
US7007015B1 (en) | Prioritized merging for full-text index on relational store | |
US5752243A (en) | Computer method and storage structure for storing and accessing multidimensional data | |
US6598051B1 (en) | Web page connectivity server | |
US20030135495A1 (en) | Database indexing method and apparatus | |
Meng et al. | Estimating the usefulness of search engines | |
EP1844391A2 (en) | Multiple index based information retrieval system | |
Vassilakopoulos et al. | Dynamic inverted quadtree: A structure for pictorial databases | |
Putz | Using a relational database for an inverted text index | |
Chang et al. | Multikey access methods based on term discrimination and signature clustering | |
Freeston | A well-behaved file structure for the storage of spatial objects | |
Macleod | Towards an information retrieval language based on a relational view of data | |
Saito et al. | Amoeba join: overcoming structural fluctuations in XML data | |
Pagh et al. | Secondary indexing in one dimension: beyond b-trees and bitmap indexes | |
Zabback et al. | Office documents on a database kernel—filing, retrieval, and archiving | |
Fung et al. | Efficient multimedia database indexing using structural join index hierarchy | |
KR100440906B1 (en) | Method and system for indexing document | |
Leung et al. | Multimedia data mining and searching through dynamic index evolution | |
Bhuiyan et al. | High Performance SQL Queries on Compressed Relational Database. | |
Amur et al. | TMS: A free‐form text‐management system | |
Vaid et al. | Spatially-Aware Information Retrieval on the Internet | |
Chang et al. | Design and evaluation of multikey access methods using signature files | |
Liu¹ et al. | Using Stem Rules to Refine Document Retrieval |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref country code: AU Ref document number: 2000 17965 Kind code of ref document: A Format of ref document f/p: F |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AL AU BA BB BG BR CA CN CU CZ EE GD GE HR HU ID IL IN IS JP KP KR LC LK LR LT LV MG MK MN MX NZ PL RO SG SI SK TR TT UA US UZ VN YU ZA |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 09868339 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1999961274 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1999961274 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1999961274 Country of ref document: EP |