A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
A retrieval technique for high-dimensional data and partially specified queries
2002
Data & Knowledge Engineering
Preserved Fulltext
Unfortunately, the multi-dimensional access methods designed for high-dimensional data perform rather poorly for these partially specified queries. ...
The retrieval technique proposed in this paper uses a combination of two complementary measures to support efficient processing of partial queries over high-dimensional data. ...
The retrieval technique proposed in this paper uses a combination of two measures to support efficient processing of partially specified queries over high-dimensional data. ...
doi:10.1016/s0169-023x(02)00023-x
fatcat:np7s4ruj7zhq5lq7vaypyrvzyi
Querying Complex Spatio-Temporal Sequences in Human Motion Databases
2008
2008 IEEE 24th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
New distance measures and queries for high dimensional categorical time series are then proposed and efficient query processing techniques for answering these queries are developed. ...
These data are typically modelled as time series of high dimensional vectors which incur expensive storage and retrieval cost as a result of the high dimensionality. ...
Definition A very common query on high dimensional time series is the sketch query, in which users describe a number of snapshots (by specifying some π and σ clauses) and the system returns those matching ...
doi:10.1109/icde.2008.4497417
dblp:conf/icde/ChenJOT08
fatcat:6m34vhdw6razlp6xrnnww6qfaa
Concentric hyperspaces and disk allocation for fast parallel range searching
1999
Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
However, most of these techniques were primarily designed for two-dimensional data and for balanced partitioning of the data space. ...
In this paper, we first establish that traditional declustering techniques do not scale for high-dimensional data. We then propose several new partitioning schemes based on concentric hyperspaces. ...
After partitioning the data space, we evaluate the techniques with high dimensional range queries. To process a range query, first, the set of buckets that will be retrieved by the query is computed. ...
doi:10.1109/icde.1999.754977
dblp:conf/icde/FerhatosmanogluAA99
fatcat:psux4hfrsveujoerahbiudiuqu
High dimensional nearest neighbor searching
2006
Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We develop a general framework for approximate NN queries, discuss various approaches for progressive processing of similarity queries, and develop a metric for evaluation of such techniques. ...
As a result of the scale and high dimensional nature, the traditional techniques have proven inadequate. ...
However, any opinions, findings, conclusions or recommendations expressed herein are those of the author, and do not necessarily reflect the views of the DOE. ...
doi:10.1016/j.is.2005.01.001
fatcat:z2kfzeqwfnekfpmt6fucje6w6a
Efficient Similarity Indexing and Searching in High Dimensions
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper presents a new approach for fast and effective searching and indexing of high dimensional features using random partitions of the feature space. ...
Efficient indexing and searching of high dimensional data has been an area of active research due to the growing exploitation of high dimensional data and the vulnerability of traditional search methods ...
Acknowledgement We would like to thank Alex Andoni of MIT for kindly providing the LSH implementation and answering questions about the LSH algorithm. ...
arXiv:1505.03090v1
fatcat:npl3qabpk5bilipzye3bqzvlpm
Caching support for skyline query processing with partially-ordered domains
2012
Proceedings of the 20th International Conference on Advances in Geographic Information Systems - SIGSPATIAL '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The results of skyline queries performed on data sets with partially-ordered domains vary depending on users' preference profiles specified for the partially-ordered domains. ...
For this purpose, we introduce a similarity measure that establishes the level of a relation of a new query to each of the previously cached queries and profiles. ...
the National Science Foundation (NSF) Grants CNS-0831502 (CT) and CNS-0855251 (CRI). ...
doi:10.1145/2424321.2424371
dblp:conf/gis/HsuehZK12
fatcat:bwilthretvhzhh7vouuy7dpzau
Optimizing multiple queries on scientific datasets with partial replicas
2007
2007 8th IEEE/ACM International Conference on Grid Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Data elements whose attribute values fall into the specified bounds are retrieved from the dataset. ...
This scenario corresponds to a case where the user wants to query and retrieve a spatial feature from the dataset. We propose cost models and an algorithm for optimizing such queries. ...
the best set of partial replicas for a given query with a rectangular multi-dimensional bounding box. ...
doi:10.1109/grid.2007.4354141
dblp:conf/grid/WengCKAS07
fatcat:fd42agtjhvcypmiyaplo7aieqa
QueST
2007
Proceedings of the 15th international conference on Multimedia - MULTIMEDIA '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An important challenge for music searching is its ability to support both keyword and content based queries efficiently and with high precision. ...
In this paper, we present a music query system − QueST (Query by acouStic and T extual features) to support both keyword and content based retrieval in large music databases. ...
The rapid growth and continued availability of music data has created a number of new challenges for managing, exploring and retrieving music data with rich query expressions, high accuracy and efficiency ...
doi:10.1145/1291233.1291465
dblp:conf/mm/CuiLPST07
fatcat:jkbd3rkxwnhkdcdipyxeckrnoa
Similarity search in content-based multimedia retrieval using spatial grid files
1998
Multimedia Storage and Archiving Systems III
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Therefore, a multimedia information system must employ multiple search and indexing mechanisms due to integration of multiple search modalities such as querying for search and for indexing, keywords and ...
In this paper, we introduce a new file structure called Spatial Grid File (SGF). This file structure enables to index multimedia objects by different and independent high-dimensional feature vectors. ...
For querying these databases, it is essential to use appropriate indexing techniques that provide fast access paths to high dimensional data for multiple attributes. ...
doi:10.1117/12.325809
fatcat:w337o44uarefxdxehieo23ov5e
Optimal Multidimensional Query Processing Using Tree Striping
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. ...
The basic idea of tree striping is to use the optimal number k of lower-dimensional indexes determined by our theoretical analysis for efficient query processing. ...
In order to answer a given range query with s attributes specified, it is necessary to access s one-dimensional indexes and to perform a costly merge of the partial results obtained from the one-dimensional ...
doi:10.1007/3-540-44466-1_24
fatcat:cixq2zulend75izft7eb257vue
A spatial grid file for multimedia data representation
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
In multimedia databases spatial or high-dimensional data manipulation is important for storage and retrieval. In this study, we introduce a new file structure called Spatial Grid File. ...
This file enables us to index data objects by different and independent high-dimensional attributes. ...
A very popular and important application area of high-dimensional data indexing is multimedia databases. ...
doi:10.1007/3-540-63371-5_17
fatcat:zqrdndl6xza5nkh4obzl5drhme
An Efficient Indexing for Content Based Image Retrieval Based on Number of Clusters Using Clustering Technique
2017
International Journal of Artificial Intelligence and Applications for Smart Devices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper focuses on a cluster based indexing technique for achieving efficient and effective retrieval performance. ...
Generally such methods suffer from the problems of high dimensionality leading to more computational time and inefficient indexing and retrieval performance. ...
The existing multi-dimensional indexing techniques concentrate on identifing and improving indexing techniques that are scalable to high dimensional feature vectors in image retrieval [7] . ...
doi:10.14257/ijaiasd.2017.5.1.01
fatcat:ooekqrtzmzeb7bculblaa4axuu
Speed up linear scan in high-dimensions by sorting one-dimensional projections
2011
International Journal of Intelligent Systems and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
High-dimensional indexing is a pervasive challenge faced in multimedia retrieval. ...
In the new search algorithm, only a small portion of data points need to be linearly accessed by computing the bounded distance on the one-dimensional line, which can reduce the I/O and processor time ...
Given this point, for k-NN queries in a high-dimensional space, linear scan remains an efficient search strategy for similarity search [3] . ...
doi:10.5815/ijisa.2011.04.06
fatcat:zua6gyeqkjag3ev3v66276sfnm
Feature Binding Technique for Integration of Biological Databases with Optimized Search and Retrieve
2012
Procedia Technology - Elsevier
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Biological databases are highly decentralized, having a high degree of difference in terminologies, feature fields, data representation and query formats. ...
Having done that, the problem of retrieving or manipulating data from a decentralized biological database is addressed in the Search & Retrieve algorithm, where stochastic and machine learning techniques ...
ACKNOWLEDGEMENT The work was partially supported by CSIR grant no. 22(0586)/12/EMR-11. ...
doi:10.1016/j.protcy.2012.10.075
fatcat:pn3d54evirbjleqhzwmf5ezt4e
Incremental indexing and retrieval mechanism for scalable and robust shape matching
2011
Multimedia Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A novel distributed beam search based technique is proposed that operates on the indexing structure and ensures no false dismissal for a given k-NN query. ...
Techniques for efficient and effective content-based image matching are becoming increasingly important with the widespread increase in digital image capturing systems. ...
The selected dimensional reduction technique should transform the high dimensional image to compact feature space while retaining most of the characteristic structure of the original data. ...
doi:10.1007/s00530-011-0252-y
fatcat:dbc36yvbk5bvvjoybcjonlergq
« Previous
Showing results 1 — 15 out of 19,661 results