Filters








52,866 Hits in 5.5 sec

The Collective Index: A Technique for Efficient Processing of Progressive Queries

Q. Zhu, B. Medjahed, A. Sharma, H. Huang
2008 Computer journal  
We introduce a query model to characterize different types of progressive queries. We then present a new index structure, called the collective index, to efficiently process progressive queries.  ...  Utilizing the special structure of a collective index, the (member) indexes on the input relation(s) of a step-query are efficiently transformed into indexes on the result relation.  ...  FUNDING Research was partially supported by the US National Science Foundation (under grants #CNS-0521142, #IIS-0414594 and #IIS-0414576) and The University of Michigan (under UMD-CEEP and UM-OVPR grants  ... 
doi:10.1093/comjnl/bxm105 fatcat:lvdv4scyurcotgu76rc3wjj2zi

Indexes for highly repetitive document collections

Francisco Claude, Antonio Fariña, Miguel A. Martínez-Prieto, Gonzalo Navarro
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
We show that techniques can compress much further, using a small fraction of the space required by our new inverted indexes, yet they are orders of magnitude slower.  ...  We introduce new compressed inverted indexes for highly repetitive document collections.  ...  For example, our Lempel-Ziv-based index is 15 times smaller than a Rice-encoded index (the best choice for classical text collections), and at most 70% slower on word and conjunctive queries.  ... 
doi:10.1145/2063576.2063646 dblp:conf/cikm/ClaudeFMN11 fatcat:monvb2ysojfxli6l62telwgmse

Indexes and indexing

Harold Borko
1973 Information Storage and Retrieval  
Its design allows queries to have a limited budget to spend on index creation. The indexing budget is automatically tuned to each query before query processing.  ...  In this paper, we introduce Progressive Indexing, a novel performance-driven indexing technique that focuses on automatic index creation while providing interactive response times to incoming queries.  ...  One could also resort to using approximate query processing techniques [5] to allow for a faster convergence.  ... 
doi:10.1016/0020-0271(73)90077-6 fatcat:chsdbeo4aralpp6ix3cduxnjva

Automatic document indexing in large medical collections

Angelos Hliaoutakis, Kalliopi Zervanou, Euripides G.M. Petrakis, Evangelos E. Milios
2006 Proceedings of the international workshop on Healthcare information and knowledge management - HIKM '06  
This information is commonly used for improving the accuracy of document indexing and retrieval in large text collections.  ...  It also allows for faster and better understanding of the contents of a document collection without first browsing through the contents of its documents.  ...  A traditional technique for automatic indexing has been the tf · idf method [18] .  ... 
doi:10.1145/1183568.1183570 dblp:conf/hikm/HliaoutakisZPM06 fatcat:zcgnbn6jsvcgvly3q5xnwefzvu

To index or not to index

Diego Arroyuelo, Senén González, Mauricio Marin, Mauricio Oyarzún, Torsten Suel
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
We also propose several efficient compressed text representations for snippet generation, which are able to use about half of the space of current state-of-the-art alternatives with little impact in query  ...  Moreover, we show that both position and textual data can be stored using about 71% of the space used by traditional positional indexes, with a minor increase in query time.  ...  Inverted Index Compression The efficiency of query processing in search engines relies on inverted indexes.  ... 
doi:10.1145/2348283.2348320 dblp:conf/sigir/ArroyueloGMOS12 fatcat:zhlsxinz35g4xo6avn2wdxrrby

THE COLLECTIVE SPATIAL KEYWORD QUERY PROCESSING BASED ON USER PREFERENCES

C. Karpagam
2017 International Journal of Advanced Research in Computer Science  
This advancement focus on collective spatial keyword query processing (CSKQP) that takes both location and textual description of content.  ...  Based on this model the query in turn returns the user favorite choice has result. We initially study the essential requirements to implement and later focus on a generative algorithm.  ...  The collective spatial keyword query processing aims to find a set of objects that collectively covers user queried keywords with minimum cost.  ... 
doi:10.26483/ijarcs.v8i9.4902 fatcat:gr6qljsobbeczgt23u2ephqg6q

Search the Audio, Browse the Video—A Generic Paradigm for Video Collections

Arnon Amir, Savitha Srinivasan, Alon Efrat
2003 EURASIP Journal on Advances in Signal Processing  
This paper describes a system where speech is used for efficient searching and visual data for efficient browsing, a combination that takes advantage of both approaches.  ...  One class is based on image processing techniques, often called content-based image and video retrieval, in which video frames are indexed and searched for visual content.  ...  ACKNOWLEDGMENT We would like to thank Heather Poyhonen for her great help with the manuscript.  ... 
doi:10.1155/s111086570321012x fatcat:wpdlika5wjdu7dnk635s64gcwq

Indexing Social Semantic Data

George H. L. Fletcher, Peter W. Beck
2008 International Semantic Web Conference  
Such partitions are the basis of engineering index data structures which are ideally suited for efficient query processing.  ...  Indexing techniques have also been developed for special classes of larger patterns, e.g., [9] ; such techniques, however, do not support processing of the full variety of BGP join patterns.  ... 
dblp:conf/semweb/FletcherB08 fatcat:z6uxcej2bfbkdajjqwbbwkrcka

VQ-index

Ertem Tuncel, Hakan Ferhatosmanoglu, Kenneth Rose
2002 Proceedings of the tenth ACM international conference on Multimedia - MULTIMEDIA '02  
In this paper, we introduce a novel indexing technique based on efficient compression of the feature space for approximate similarity searching in large multimedia databases.  ...  The employed VQ techniques inherently provide a spectrum of points to choose from on the time/accuracy plane.  ...  Exact NN Query Processing For efficient query processing in large data sets, it is necessary to build an index structure that reduces the size of the retrieved set needed to answer a query.  ... 
doi:10.1145/641113.641117 fatcat:fukti4wdofcrtffqlffnil6m44

VQ-index

Ertem Tuncel, Hakan Ferhatosmanoglu, Kenneth Rose
2002 Proceedings of the tenth ACM international conference on Multimedia - MULTIMEDIA '02  
In this paper, we introduce a novel indexing technique based on efficient compression of the feature space for approximate similarity searching in large multimedia databases.  ...  The employed VQ techniques inherently provide a spectrum of points to choose from on the time/accuracy plane.  ...  Exact NN Query Processing For efficient query processing in large data sets, it is necessary to build an index structure that reduces the size of the retrieved set needed to answer a query.  ... 
doi:10.1145/641007.641117 dblp:conf/mm/TuncelFR02 fatcat:e6wpplvf7zgkxio3cptmqt4lmm

Efficient approximate search on string collections

Marios Hadjieleftheriou, Chen Li
2009 Proceedings of the VLDB Endowment  
This tutorial provides a comprehensive overview of recent research progress on the important problem of approximate search in string collections.  ...  We identify existing indexes, search algorithms, filtering strategies, selectivity-estimation techniques and other work, and comment on their respective merits and limitations.  ...  This tutorial focuses on the following problem: Given a collection of strings, efficiently identify the ones similar to a given query string. Such a query is called an "approximate string search."  ... 
doi:10.14778/1687553.1687623 fatcat:hsji7ybwr5brzfdkduwntzvpl4

Progressive Indexing for Interactive Analytics

Michael Hohenstein
2021 Workshop Grundlagen von Datenbanken  
In this paper we briefly investigate the similarities of PVA to approximate query processing and present an indexing strategy which can be utilized in approximate and progressive environments without conflicting  ...  Progressive Visual Analytics (PVA) is a recent paradigm in the realm of visualization.  ...  Lastly, in the Consolidation Phase the ordered index is now progressively converted to a B+ tree for query efficiency.  ... 
dblp:conf/gvd/Hohenstein21 fatcat:n6pyyrgs5fckfjmzc7t3vb66sy

Efficient search in large textual collections with redundancy

Jiangong Zhang, Torsten Suel
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
In this paper, we propose a general framework for indexing and query processing of archival collections and, more generally, any collections with a sufficient amount of redundancy.  ...  Current engines use various techniques for index compression and optimized query execution, but these techniques do not exploit the significant similarities between different versions of a page, or between  ...  We also thank the Stanford WebBase project for providing access to the crawl data used in our experiments.  ... 
doi:10.1145/1242572.1242628 dblp:conf/www/ZhangS07 fatcat:6y2lt2heqjh7zf54vv6hmy7pqu

XML Document Indexes: A Classification

B. Catania, A. Maddalena, A. Vakali
2005 IEEE Internet Computing  
) and XPath (www.w3.org/TR/xpath) for XML; • an efficient query processor; and • efficient indexing techniques that let the query processor efficiently access (parts of) XML documents according to query  ...  This, in turn, has increased the demand for ad hoc techniques for XML query processing.  ...  ) and XPath (www.w3.org/TR/xpath) for XML; • an efficient query processor; and • efficient indexing techniques that let the query processor efficiently access (parts of) XML documents according to query  ... 
doi:10.1109/mic.2005.115 fatcat:q6kzzxtdszen5clgemc4mc7wr4

Graph Indexing [chapter]

Xifeng Yan, Jiawei Han
2010 Managing and Mining Graph Data  
One of the most important functions needed in these areas is efficient search of complex graph data.  ...  Given a graph query, it is desirable to retrieve relevant graphs quickly from a large database via efficient graph indices.  ...  Efficient indexing techniques for path expression were initially introduced in DataGuide [13] and 1-index [23] .  ... 
doi:10.1007/978-1-4419-6045-0_5 dblp:series/ads/YanH10 fatcat:gzvvnnmayfhqndjk3lipp6erlu
« Previous Showing results 1 — 15 out of 52,866 results