Filters








1,625 Hits in 6.0 sec

Partial evaluation of queries for bit-sliced signature files

Seyit Kocberber, Fazli Can
1996 Information Processing Letters  
A new signature file optimization method, Partially evaluated Bit-Sliced Signature File (P-BSSF), for multi-term query environments using the partial evaluation approach is introduced.  ...  Our research extends the bit-sliced signature organization by introducing a partial evaluation approach for queries.  ...  We propose a new signature file optimization method, Partially evaluated Bit-Sliced Signature File (P-BSSF), which combines optimal selection of S with a partial evaluation strategy in a multi-term query  ... 
doi:10.1016/s0020-0190(96)00176-7 fatcat:r7joss3rwvaqlabawbs5dsfehy

Vertical framing of superimposed signature files using partial evaluation of queries

Seyit Kocberbera, Fazli Can
1997 Information Processing & Management  
A new signature file method, Multi-Frame Signature File (MFSF), is introduced by extending the bit-sliced signature file method.  ...  In MFSF, a signature file is divided into variable sized vertical frames with different on-bit densities to optimize the response time using a partial query evaluation methodology.  ...  Acknowledgemenrs-We are grateful to a referee for insightful comments that improved the presentation  ... 
doi:10.1016/s0306-4573(96)00073-8 fatcat:qrotrvbvanegbls4fmk3qis6zq

Comparing inverted files and signature files for searching a large lexicon

Ben Carterette, Fazli Can
2005 Information Processing & Management  
In this paper we undertake a direct comparison of the two for searching for partially-specified queries in a large lexicon stored in main memory.  ...  Using n-grams to index lexicon terms, a bit-sliced signature file can be compressed to a smaller size than an inverted file if each n-gram sets only one bit in the term signature.  ...  We thank Justin Zobel for making his inverted file code freely available. We are very grateful to the referees, whose comments and suggestions greatly improved the focus of this work. Note.  ... 
doi:10.1016/j.ipm.2003.12.003 fatcat:ndkoxvtxuff7dptnhybzxrz5ja

Bit-sliced signature files for very large text databases on a parallel machine architecture [chapter]

George Panagopoulos, Christos Faloutsos
1994 Lecture Notes in Computer Science  
We provide formulae for the optimal number of signature slices to fetch and match with the query signature.  ...  We propose the use of a Parallel Bit-Sliced Signature File method on a SIMD machine architecture when the size of the signature le exceeds the available memory.  ...  Section 2 is an introduction to the terminology used and a review of the Bit-Sliced Signature File method.  ... 
doi:10.1007/3-540-57818-8_65 fatcat:l2ljjnllzjdpfol3gfbqkl5z5e

Optimization of signature file parameters for databases with varying record lengths

S Kocberber
1999 Computer journal  
In signature file processing, accurate estimation of the number of false drops is essential to obtain a more accurate signature file and therefore to obtain a better (query) response time.  ...  For signature files we propose a new false drop estimation method for databases with varying record lengths.  ...  Their suggestions have greatly improved both the contents and presentation of the paper.  ... 
doi:10.1093/comjnl/42.1.11 fatcat:nkjf4v7tpzc3tba6edm2jairgi

Inverted files versus signature files for text indexing

Justin Zobel, Alistair Moffat, Kotagiri Ramamohanarao
1998 ACM Transactions on Database Systems  
Not only can inverted files be used to evaluate typical queries in less time than can signature files, but inverted files require less space and provide greater functionality.  ...  We have undertaken a detailed comparison of these two approaches in the context of text indexing, paying particular attention to query evaluation speed and space requirements.  ...  ACKNOWLEDGMENTS We are grateful to Alan Kent for help with the signature file system, Tim Shimmin for help with MG, and Despina Psaradellis for programming assistance.  ... 
doi:10.1145/296854.277632 fatcat:cqxnkypdurawdlbpp2eur6ktne

Design and evaluation of signature file organization incorporating vertical and horizontal decomposition schemes [chapter]

Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu Ishikawa
1996 Lecture Notes in Computer Science  
We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values  ...  This paper presents a new signature le organization method, named Partitioned F rame-Sliced Signature File (P-FSSF), and studies its performance.  ...  This work was partially supported by the Grandin-Aid for Science Research on Priority Areas from the Ministry of Education, Science, Sports and Culture of Japan.  ... 
doi:10.1007/bfb0034739 fatcat:mtfdeuitwvfzpn3rtrn7vhoqc4

Dynamic allocation of Signature Files on Parallel devices

Man-Kwan Shan, Suh-Yin Lee
1998 Information Systems  
Efficient allocation of signature file on parallel device minimizes the query response time and is important in the design of large databases.  ...  Signature file is one of the efficient access methods for retrieval of text database. In a large database server, parallel device is utilized to achieve concurrent access.  ...  Acknowledgements -We thank the anonymous referees for their valuable comments and suggestions. 111  ... 
doi:10.1016/s0306-4379(98)00024-6 fatcat:o6xtuzh2tbhb3igsv76rtxseyy

Frame-sliced partitioned parallel signature files

Fabio Grandi, Paolo Tiberio, Pavel Zezula
1992 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92  
The retrieval capabilities of the signature file access method have become very attractive for many data pro-  ...  The hypothesis that the use of a partitioned approach in a sliced environment will stabilize performance for different query weights has only partially proved to be true.  ...  The number of blocks accessed per qualifying parti- tion can be evaluated, according to [21], as follows: sliced and part it ioned met hods alone. 4.2.2 Evaluation of wnk (Q) for clustered  ... 
doi:10.1145/133160.133211 dblp:conf/sigir/GrandiTZ92 fatcat:xntfwnhr6jdb3ecxhpa47wcwb4

A dynamic signature technique for multimedia databases

F. Rabitti, P. Zezula
1990 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '90  
A signature file acts us a filtering mechanism to reduce the amount of data that needs to be searched during query evaluation.  ...  Even though several techniques for organizing and searching signature files have been proposed in literature, they  ...  , and performance evaluations. 4-L The Basic Idea The quick filter is an organization of signature strings, not slices like the Bit-slice organization.  ... 
doi:10.1145/96749.98223 dblp:conf/sigir/RabittiZ90 fatcat:pse3akvaljajjlywnhxrzlv4su

Efficient processing of joins on set-valued attributes

Nikos Mamoulis
2003 Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03  
We show that the inverted file, a powerful index for selection queries, can also facilitate the efficient evaluation of most join predicates.  ...  We propose join algorithms that utilize inverted files and compare them with signature-based methods for several set-comparison predicates.  ...  Figure 1 shows an example of a bit-sliced signature file. If the query signature is 1001000100, we need to join slices S0, S3, and S7 in order to get the candidate rids.  ... 
doi:10.1145/872757.872778 dblp:conf/sigmod/Mamoulis03 fatcat:byykjdeghvenvkjteeipu7y7ei

Efficient processing of joins on set-valued attributes

Nikos Mamoulis
2003 Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03  
We show that the inverted file, a powerful index for selection queries, can also facilitate the efficient evaluation of most join predicates.  ...  We propose join algorithms that utilize inverted files and compare them with signature-based methods for several set-comparison predicates.  ...  Figure 1 shows an example of a bit-sliced signature file. If the query signature is 1001000100, we need to join slices S0, S3, and S7 in order to get the candidate rids.  ... 
doi:10.1145/872773.872778 fatcat:acnzk2xmnjd4zduavozqyhwu5m

Towards a Realistic Model of Indices in Object Bases [chapter]

Boris Novikov
1996 Workshops in Computing  
A comparison of several indexing techniques for complex object in object-oriented database systems is presented, based on assumption of non-uniform distribution of attribute values.  ...  The cost estimations show that conventional ordered indices, especially nested indices with object skeletons, can provide better performance than signature files.  ...  This cost may be significantly reduced when the signature file is represented as a set of bit-slices, because only bit-slices corresponding to 1-bits in query signature should be scanned.  ... 
doi:10.1007/978-1-4471-1486-4_19 dblp:conf/adbis/Novikov95 fatcat:epaons3uzbb5voin4fcqdzvvby

Peak your Frequency: Advanced Search of 3D CAD Files in the Fourier Domain

Dimitris Mouris, Charles Gouert, Nikhil Gupta, Nektarios Georgios Tsoutsos
2020 IEEE Access  
Our experimental results demonstrate the efficiency and high accuracy of our approach for both exact and partial matching, rendering FFS a powerful framework for CAD model search.  ...  In addition, FFS supports both exact and partial matching in order to provide helpful and robust search results for any scenario.  ...  Any opinions, findings, and conclusions or recommendations expressed in this article are those of the authors and do not necessarily reflect the views of NSF.  ... 
doi:10.1109/access.2020.3013284 fatcat:4wtiqzlemvdifhr3jddsuhm7jy

Placement of partitioned signature file and its performance analysis

Man-Kwan Shan, Suh-Yin Lee
1998 Information Sciences  
The formula of performance for a specific query signature is also derived. It is useful for the access cost estimation of query optimization in information retrieval.  ...  In this paper, we investigate the placement of partitioned signature file to minimize the number of clusters pertinent to the query signature in dynamic environment.  ...  Approaches for the storage structure of signature file include sequential, Bit-Slice, Frame-Slice, S-Tree, Quick Filter, etc.  ... 
doi:10.1016/s0020-0255(97)00062-5 fatcat:247j7cd4x5c4nmx4ewsngdzg6m
« Previous Showing results 1 — 15 out of 1,625 results