Filters








45,848 Hits in 3.7 sec

Two-Dimensional Distributed Inverted Files [chapter]

Esteban Feuerstein, Mauricio Marin, Michel Mizrahi, Veronica Gil-Costa, Ricardo Baeza-Yates
2009 Lecture Notes in Computer Science  
We propose to arrange a set of processors in a two-dimensional array, applying term-partitioning at row level and document-partitioning at column level.  ...  From the literature we can learn of a number of methods for distributing the inverted file onto P processors or computers and their respective query processing strategies [1, 4, 6, 9-11, 14, 18] .  ...  A natural idea to overcome the problems of these two approaches is to use a two-dimensional scheme trying to benefit from the advantages of the two extreme distributed indexes.  ... 
doi:10.1007/978-3-642-03784-9_20 fatcat:5kloeouqsndadop4belgpqqjca

The Grid File: An Adaptable, Symmetric Multikey File Structure

J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik
1984 ACM Transactions on Database Systems  
Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access.  ...  This tile system adapts gracefully to its contents under insertions and deletions, and thus achieves an upper hound of two disk accesses for single record retrieval; it also handles range queries and partially  ...  Willinger for writing an early version of the simulation program, and to the following people for communicating to us their experiences about ongoing implementations of the grid file: K.  ... 
doi:10.1145/348.318586 fatcat:hzlg2b7ebjavjbyk2cxugnzdxi

The grid file: An adaptable, symmetric multi-key file structure [chapter]

J. Nievergelt, H. Hinterberger, K. C. Sevcik
1981 Lecture Notes in Computer Science  
Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access.  ...  This tile system adapts gracefully to its contents under insertions and deletions, and thus achieves an upper hound of two disk accesses for single record retrieval; it also handles range queries and partially  ...  Willinger for writing an early version of the simulation program, and to the following people for communicating to us their experiences about ongoing implementations of the grid file: K.  ... 
doi:10.1007/3-540-10885-8_45 fatcat:kj4n3qk6ofegheoaakiyto54bu

STQP: Spatio-Temporal Indexing and Query Processing

Nikhat Fatima, Ayesha Ameen, Syed Raziuddin
2016 International Journal of Computer Applications  
To reduce the complexity of nD histogram, nD factor data distribution into two-dimensional (2D) distributions is used. The modeling of a dataset generates a model called junction tree.  ...  The inverted file is stored separately, for two reasons: First, it is more efficient to store each inverted file contiguously, rather than as a sequence of blocks or pages that are scattered across a disk  ... 
doi:10.5120/ijca2016911514 fatcat:jdgvwpgnkbb7bgsbpqtzmxzkvm

CLSH

Xiangyang Xu, Tongwei Ren, Gangshan Wu
2014 Proceedings of International Conference on Internet Multimedia Computing and Service - ICIMCS '14  
"Scalable nearest neighbour methods for high dimensional data." (2013).  ...  "Scalable nearest neighbour methods for high dimensional data." (2013).  ...  Use LSH to find NNs Two criteria for choosing nearest ClusterID(s) Clustering Feature points Writing to Index Files Index Files ...  ... 
doi:10.1145/2632856.2632868 dblp:conf/icimcs/XuRW14 fatcat:cqdtva6a2rbdnjk5cs5h4noyri

YFCC100M HybridNet fc6 Deep Features for Content-Based Image Retrieval

Giuseppe Amato, Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti
2016 Proceedings of the 2016 ACM Workshop on Multimedia COMMONS - MMCommons '16  
Moreover, we present experimental results obtained indexing this corpus with two distinct approaches: the Metric Inverted File and the Lucene Quantization.  ...  These two CBIR systems are public available online allowing real-time search using both internal and external queries.  ...  The two CBIR systems use two very different approach: the Metric Inverted File (MI-File) (Section 4.1.1) and the Lucene Quantization (Section 4.1.2).  ... 
doi:10.1145/2983554.2983557 fatcat:ayqkkrvufbgmxoicy35iogneju

ISIS: A New Approach for Efficient Similarity Search in Sparse Databases [chapter]

Bin Cui, Jiakui Zhao, Gao Cong
2010 Lecture Notes in Computer Science  
In this paper, we propose a novel index structure for accelerating similarity search in high-dimensional sparse databases, named ISIS, which stands for Indexing Sparse databases using Inverted fileS.  ...  ISIS clusters a dataset and converts the original high-dimensional space into a new space where each dimension represents a cluster; furthermore, the key values in the new space are used by Inverted-files  ...  The method of directly adapting inverted-files to support similarity queries in sparse databases suffers from two limitations.  ... 
doi:10.1007/978-3-642-12098-5_18 fatcat:xo5zymou5jflhlq3qpst5pwfte

Electrical resistivity modeling around the Hidaka collision zone, northern Japan: regional structural background of the 2018 Hokkaido Eastern Iburi earthquake (Mw 6.6)

Hiroshi Ichihara, Toru Mogi, Hideyuki Satoh, Yusuke Yamaya
2019 Earth, Planets and Space  
The inverted resistivity model showed a significant area of high resistivity around the center of the collision boundary.  ...  In this study, we used three-dimensional inversion to reanalyze broadband magnetotelluric data acquired in the collision zone.  ...  Takeshi Hashimoto of Hokkaido University and two anonymous reviewers improved the manuscript.  ... 
doi:10.1186/s40623-019-1078-7 fatcat:otiartcin5h5hbaauf3fg6xqhq

Using Inverted Files to Compress Text

Strahil Ristov
2002 Journal of Computing and Information Technology  
It consists of representing the text file with compressed inverted file index in conjunction with very compact lexicon, where lexicon includes every word in the text.  ...  Compression procedure is complex, but decompression time is linear with the file size, although it requires two passes and hence can not be performed online.  ...  If we consider only one text file and use distinct words as lexicon terms then the pointers can be one-dimensional, just the positions of each word in the file.  ... 
doi:10.2498/cit.2002.03.02 fatcat:ht3k6gf3yffm7od6rmz2zwholm

Correction to: Two-dimensional indexing to provide one-integrated-memory view of distributed memory for a massively-parallel search engine

Tae-Seob Yun, Kyu-Young Whang, Hyuk-Yoon Kwon, Jun-Sung Kim, Il-Yeol Song
2019 World wide web (Bussum)  
Item 1) We adopt the notion of two-dimensional distributed inverted files proposed by Feuerstein et al. (2009) with the purpose of optimizing the entire system cost including computation, communication  ...  We call this extended scheme and associated algorithms two-dimensional indexing.  ...  Figure 2 shows the concept of providing a one-integrated-memory view of collective memories by using two-dimensional indexing over n × m two-dimensional distributed memory.  ... 
doi:10.1007/s11280-019-00679-9 fatcat:hmii33kwvbac5mnbqmigfebgom

Selective K-means Tree Search

Tuan Anh Nguyen, Yusuke Matsui, Toshihiko Yamasaki, Kiyoharu Aizawa
2015 Proceedings of the 23rd ACM international conference on Multimedia - MM '15  
Experiments based on approximate nearest neighbor search using a large dataset comprising one billion SIFT features showed that the hierarchical inverted file based on the selective k-means tree method  ...  However, a problem of previous inverted indexing methods is that a large-scale inverted index is required to achieve a high search recall rate.  ...  SELECTIVE K-MEANS TREE SEARCH In this section, we introduce our inverted file (SKT-ADC) based on a two-layer selective k-means tree ( Figure 2) .  ... 
doi:10.1145/2733373.2806353 dblp:conf/mm/NguyenMYA15 fatcat:zzudnyca3nejhmjbph34lz7qea

Factorial Correspondence Analysis for image retrieval

Nguyen-Khang Pham, Annie Morin, Patrick Gros, Quyet-Thang Le
2008 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies  
To scale up and improve the quality of research, we propose a new retrieval schema using inverted files based on the relevant indicators of Correspondence Analysis (the quality of representation and contribution  ...  In fact, we associate two inverted files with each axis (one for positive part and another for negative part).  ...  In this algorithm, there are two parameters to tune: the number of inverted files to take n, in step 3 and n_thres in step 5.  ... 
doi:10.1109/rivf.2008.4586366 dblp:conf/rivf/PhamMGL08 fatcat:b65f26agq5btxjsrn47eka4lqm

An average-case analysis of MAT and inverted file

Nageswara S.V. Rao, S.S. Iyengar, R.L. Kashyap
1988 Theoretical Computer Science  
We show that the multiple attribute tree is more efficient than the inverted file in terms of these expected value measures.  ...  It is shown in the literature that the multiple attribute tree outperforms inverted files in terms of worst-case complexities for partial-match queries.  ...  See [l] for more details on inverted files. There are k inverted files.  ... 
doi:10.1016/0304-3975(88)90069-2 fatcat:mz3dqdcwavhhdibp7pfoxeelsa

A New Approach for Mitigation of Voltage Dips on MV/LV Distribution Network

S. Sundeep, Trinath K, Ch. Naga Koti Kumar, P. Linga Reddy
2011 International Journal of Engineering and Technology  
Thus the segmentation of Gurmukhi text calls for a two dimensional analysis instead of commonly used One dimensional analysis for Roman script. V. APPENDIX III.  ...  The image file is in grey scale. But we require two types of information either zero or one.  ... 
doi:10.7763/ijet.2011.v3.257 fatcat:qfb7yo4pjbhqjargulghosqd6u

High-dimensional index structures database support for next decade's applications (tutorial)

Stefan Berchtold, Daniel A. Keim
1998 Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD '98  
Scheck for the very interesting and helpful discussions about the VA-file.  ...  Distance threshold which requires more data pages to be considered The two solutions to multidimensional indexing -inverted lists and multidimensional indexes -are both inefficient. i 1 π ------- Γ d 2  ...  I Statistical Model: I For the d-dimensional distribution holds:where D is the distribution of the distance of the query point and a data point and we consider a L p metric.I This is true for synthetic  ... 
doi:10.1145/276304.276353 dblp:conf/sigmod/BerchtoldK98 fatcat:pde4px7oxng2xhhclfrkxawmty
« Previous Showing results 1 — 15 out of 45,848 results