Results 231 to 240 of about 605,818 (269)
Some of the next articles are maybe not open access.
Indexing consistency, quality and efficiency
Information Processing & Management, 1981Indexing quality determines whether the information content of an indexed document is accurately represented. Indexing effectiveness measures whether an indexed document is correctly retrieved every time it is relevant to a query. Measurement of these criteria is cumbersome and costly; data base producers therefore prefer inter-indexer consistency as a
openaire +1 more source
Efficient Indexing of Spatiotemporal Objects
2002Spatiotemporal objects i.e., objects which change their position and/or extent over time, appear in many applications. This paper addresses the problem of indexing large volumes of such data. We consider general object movements and extent changes. We further concentrate on "snapshot" as well as small "interval" historical queries on the gathered data.
Marios Hadjieleftheriou +3 more
openaire +1 more source
Efficient structural joins with on-the-fly indexing
Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05, 2005Previous work on structural joins mostly focuses on maintaining offline indexes on disks. Most of them also require the elements in both sets to be sorted. In this paper, we study an on-the-fly, in-memory indexing approach to structural joins. There is no need to sort the elements or maintain indexes on disks.
Kun-Lung Wu +2 more
openaire +1 more source
Efficient metric indexing for similarity search
2015 IEEE 31st International Conference on Data Engineering, 2015The goal in similarity search is to find objects similar to a specified query object given a certain similarity criterion. Although useful in many areas, such as multimedia retrieval, pattern recognition, and computational biology, to name but a few, similarity search is not yet supported well by commercial DBMS.
Lu Chen 0001 +4 more
openaire +2 more sources
Is Equilibrium Indexation Efficient?
The Quarterly Journal of Economics, 1988This paper investigates the welfare properties of equilibrium indexation in a decentralized economy. If indexation is costless, so all firms index, then the equilibrium degree of indexation is efficient. But if indexation is costly and this leads some firms not to index, equilibrium indexation is inefficient because indexation has externalities for ...
openaire +1 more source
Efficient index compression in DB2 LUW
Proceedings of the VLDB Endowment, 2009In database systems, the cost of data storage and retrieval are important components of the total cost and response time of the system. A popular mechanism to reduce the storage footprint is by compressing the data residing in tables and indexes. Compressing indexes efficiently, while maintaining response time requirements, is known to be challenging ...
Bishwaranjan Bhattacharjee +8 more
openaire +1 more source
Efficient Index-Based Audio Matching
IEEE Transactions on Audio, Speech, and Language Processing, 2008Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even though recent identification algorithms show a significant degree of robustness towards noise, MP3 compression artifacts, and uniform temporal distortions, the notion of ...
Frank Kurth, Meinard Müller
openaire +2 more sources
Complexity of indexing: Efficient and learnable large database indexing
1996Object recognition starts from a set of image measurements (including locations of points, lines, surfaces, color, and shading), which provides access into a database where representations of objects are stored. We describe a complexity theory of indexing, a meta-analysis which identifies the best set of measurements (up to algebraic transformations ...
Michael Werman, Daphna Weinshall
openaire +1 more source
An Efficient Index Scheme for XML Databases
2006Finding efficient and useful ways to search and index XML documents is a popular research topic in the field of computer and information science today. The path-based indexing method shows disadvantages of performance degradation when performing join operations of ancestor-descendent relationships and searching for middle and lower level nodes.
Young Kim +4 more
openaire +1 more source
An efficient indexing scheme for objects with roles
1997Indexing schemes for traditional Object-Oriented Databases (OODBs) are divided into two catalogues: class hierarchy indexing and nested indexing. Since most of these systems are static in nature, dynamic operations like class versioning and role playing are not supported by traditional indexing schemes.
Franky Lam +2 more
openaire +1 more source