Results 1 - 10 of 169

Efficient Storage Techniques for Digital Continuous Multimedia

by P. Venkat Rangan, Harrick M. Vin - IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING , 1993
"... Advances in storage and networking have led to the development of multimedia computing systems capable of offering services such as multimedia mail, news distribution, advertisement, and entertainment. Supporting such services requires the integration of storage and transmission of multimedia data ..."
Abstract - Cited by 126 (2 self) - Add to MetaCart
, and derives storage patterns so as to guarantee continuous retrieval of media strands. To efficiently utilize the disk space, we develop mechanisms for merging storage patterns of multiple media strands, by filling the gapsbetween media blocks of one strand with media blocks of other strands. We propose

Incremental Updates of Inverted Lists for Text Document Retrieval

by Anthony Tomasic, Hector Garcia-molina, Kurt Shoens , 1993
"... With the proliferation of the world's "information highways" a renewed interest in efficient document indexing techniques has come about. In this paper, the problem of incremental updates of inverted lists is addressed using a new dual-structure index data structure. The index dynamic ..."
Abstract - Cited by 104 (10 self) - Add to MetaCart
With the proliferation of the world's "information highways" a renewed interest in efficient document indexing techniques has come about. In this paper, the problem of incremental updates of inverted lists is addressed using a new dual-structure index data structure. The index

Storage and Retrieval of Individual Genomes

by Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki , 2009
"... A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Examples of such collections are version control data and genome sequences of individuals, where the differences can be expre ..."
Abstract - Cited by 15 (1 self) - Add to MetaCart
be expressed by lists of basic edit operations. Flexible and efficient data analysis on a such typically huge collection is plausible using suffix trees. However, suffix tree occupies O(N log N) bits, which very soon inhibits in-memory analyses. Recent advances in full-text self-indexing reduce the space

Efficient Snapshot Retrieval over Historical Graph Data

by Udayan Khurana, Amol Deshpande - In Proc. 29th International Conference on Data Engineering , 2013
"... We address the problem of managing historical data for large evolv-ing information networks like social networks or citation networks, with the goal to enable temporal and evolutionary queries and anal-ysis. We present the design and architecture of a distributed graph database system that stores th ..."
Abstract - Cited by 17 (0 self) - Add to MetaCart
-troduce DeltaGraph, a novel, extensible, highly tunable, and dis-tributed hierarchical index structure that enables compactly record-ing the historical information, and that supports efficient retrieval of historical graph snapshots for single-site or parallel processing. Along with the original graph data

A hybrid spatio-temporal data model and structure (HST-DMS) for efficient storage and retrieval of land use information

by Raja Sengupta, Chen Yan - Transactions in GIS , 2004
"... While the incorporation of geographical and environmental modeling with GIS requires software support for storage and retrieval of spatial information that changes over time, it continues to be an unresolved issue with modern GIS software. Two complementary approaches have been used to manage the sp ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
of repeated data elements present in spatio-temporal information. It is proposed in this paper that both approaches have merit and can be combined to create a Hybrid Spatio-Temporal Data Model and Structure (HST-DMS) that efficiently supports spatio-temporal data storage and querying. Specifically, Peuquet

A New Compression Based Index Structure for Efficient Information Retrieval

by Kemal Ataturk Avenue Banani Dhaka
"... Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes th ..."
Abstract - Add to MetaCart
Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes

A New Compression Based Index Structure for Efficient Information Retrieval

by Md. Abdullah Al Mamun, Tanvir Ahmed
"... Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes th ..."
Abstract - Add to MetaCart
Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes

Fusion Coding of Correlated Sources for Storage and Selective Retrieval

by Sharadh Ramaswamy, Jayant Nayak, Kenneth Rose
"... Abstract—We focus on a new, potentially important application of source coding directed toward storage and retrieval, termed fusion coding of correlated sources. The task at hand is to efficiently store multiple correlated sources in a database so that, at any point of time in the future, data from ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Abstract—We focus on a new, potentially important application of source coding directed toward storage and retrieval, termed fusion coding of correlated sources. The task at hand is to efficiently store multiple correlated sources in a database so that, at any point of time in the future, data from

S.: Effective and Efficient Entity Search in RDF Data

by Roi Blanco, Peter Mika, Sebastiano Vigna - ISWC 2011, Part I. LNCS , 2011
"... Abstract. Triple stores have long provided RDF storage as well as data access using expressive, formal query languages such as SPARQL. The new end users of the Semantic Web, however, are mostly unaware of SPARQL and overwhelmingly prefer imprecise, informal keyword queries for searching over data. A ..."
Abstract - Cited by 18 (3 self) - Add to MetaCart
. In this work, we propose a method for effective and efficient entity search over RDF data. We describe an adaptation of the BM25F ranking function for RDF data, and demonstrate that it outperforms other state-of-the-art methods in ranking RDF resources. We also propose a set of new index structures

Efficient in-memory top-k document retrieval

by Matthias Petri, Falk Scholer , 2012
"... For over forty years the dominant data structure for ranked document retrieval has been the inverted index. Inverted indexes are effective for a variety of document retrieval tasks, and particularly efficient for large data collection scenarios that require disk access and storage. However, many eff ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
For over forty years the dominant data structure for ranked document retrieval has been the inverted index. Inverted indexes are effective for a variety of document retrieval tasks, and particularly efficient for large data collection scenarios that require disk access and storage. However, many
Results 1 - 10 of 169