[go: up one dir, main page]

Antol et al., 2019 - Google Patents

BM-index: balanced metric space index based on weighted Voronoi partitioning

Antol et al., 2019

View PDF
Document ID
9110540432907736938
Author
Antol M
Dohnal V
Publication year
Publication venue
European Conference on Advances in Databases and Information Systems

External Links

Snippet

Processing large volumes of various data requires index structures that can efficiently organize them on secondary memory. Methods based on pivot permutations have become popular because of their tremendous querying performance. Pivot permutations can be …
Continue reading at www.researchgate.net (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G06F17/30533—Other types of queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30705—Clustering or classification
    • G06F17/3071—Clustering or classification including class or cluster creation or modification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2216/00—Indexing scheme relating to additional aspects of information retrieval not explicitly covered by G06F17/30 and subgroups
    • G06F2216/03—Data mining
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system

Similar Documents

Publication Publication Date Title
Traina et al. Fast indexing and visualization of metric data sets using slim-trees
US5995114A (en) Applying numerical approximation to general graph drawing
Stottler et al. Rapid Retrieval Algorithms for Case-Based Reasoning.
Novak et al. PPP-codes for large-scale similarity searching
US11163831B2 (en) Organizing hierarchical data for improved data locality
Wu et al. Dynamic index construction with deep reinforcement learning
Slanináková et al. Data-driven learned metric index: an unsupervised approach
Jo et al. A progressive kd tree for approximate k-nearest neighbors
Mic et al. Speeding up similarity search by sketches
Keivani et al. Improved maximum inner product search with better theoretical guarantee using randomized partition trees
Siddique et al. Comparing synopsis techniques for approximate spatial data analysis
Belesiotis et al. Spatio-textual user matching and clustering based on set similarity joins
Bustos et al. Adapting metric indexes for searching in multi-metric spaces
Khosla et al. A faster algorithm for cuckoo insertion and bipartite matching in large graphs
Benouini et al. Fast feature selection algorithm for neighborhood rough set model based on Bucket and Trie structures
Antol et al. BM-index: balanced metric space index based on weighted Voronoi partitioning
Arutyunova et al. Upper and lower bounds for complete linkage in general metric spaces
Douar et al. LC-mine: a framework for frequent subgraph mining with local consistency techniques
Wang et al. Spatial queries based on learned index
Antol et al. Optimizing query performance with inverted cache in metric spaces
Figueroa et al. Improving the list of clustered permutation on metric spaces for similarity searching on secondary memory
Tokoro et al. Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Antol Faculty of Informatics, Masaryk University, Botanicka 68a, Brno, Czech Republic {xantol, dohnal}@ fi. muni. cz Abstract. Processing large volumes of various data requires index structures that can efficiently organize them on secondary memory.
Lokoč et al. Cut-region: A compact building block for hierarchical metric indexing
Bernhauer et al. Non-metric similarity search using genetic trigen