Similarity-based ranking and query processing in multimedia databases

Kasim Candan, Wen Syan Li, M. Lakshmi Priya

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

Since media-based evaluation yields similarity values, results to a multimedia database query, Q(Y1, ..., Yn), is defined as an ordered list SQ of n-tuples of the form 〈X1, ..., Xn〉. The query Q itself is composed of a set of fuzzy and crisp predicates, constants, variables, and conjunction, disjunction, and negation operators. Since many multimedia applications require partial matches, SQ includes results which do not satisfy all predicates. Due to the ranking and partial match requirements, traditional query processing techniques do not apply to multimedia databases. In this paper, we first focus on the problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, providing the user with a meaningful final ranking'. More specifically, we study the problem of merging similarity values in queries with multiple fuzzy predicates. We describe the essential multimedia retrieval semantics, compare these with the known approaches, and propose a semantics which captures the requirements of multimedia retrieval problem. We then build on these results in answering the related problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, finding an efficient way to process the query.' We develop an algorithm to efficiently process queries with unordered fuzzy predicates (sub-queries). Although this algorithm can work with different fuzzy semantics, it benefits from the statistical properties of the semantics proposed in this paper. We also present experimental results for evaluating the proposed algorithm in terms of quality of results and search space reduction.

Original languageEnglish (US)
Pages (from-to)259-298
Number of pages40
JournalData and Knowledge Engineering
Volume35
Issue number3
DOIs
StatePublished - Dec 2000

Fingerprint

Query processing
Semantics
Merging
Data base
Query
Ranking
Multimedia

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Similarity-based ranking and query processing in multimedia databases. / Candan, Kasim; Li, Wen Syan; Lakshmi Priya, M.

In: Data and Knowledge Engineering, Vol. 35, No. 3, 12.2000, p. 259-298.

Research output: Contribution to journalArticle

Candan, Kasim ; Li, Wen Syan ; Lakshmi Priya, M. / Similarity-based ranking and query processing in multimedia databases. In: Data and Knowledge Engineering. 2000 ; Vol. 35, No. 3. pp. 259-298.
@article{30f0709750fd41e4b9166c916355cf48,
title = "Similarity-based ranking and query processing in multimedia databases",
abstract = "Since media-based evaluation yields similarity values, results to a multimedia database query, Q(Y1, ..., Yn), is defined as an ordered list SQ of n-tuples of the form 〈X1, ..., Xn〉. The query Q itself is composed of a set of fuzzy and crisp predicates, constants, variables, and conjunction, disjunction, and negation operators. Since many multimedia applications require partial matches, SQ includes results which do not satisfy all predicates. Due to the ranking and partial match requirements, traditional query processing techniques do not apply to multimedia databases. In this paper, we first focus on the problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, providing the user with a meaningful final ranking'. More specifically, we study the problem of merging similarity values in queries with multiple fuzzy predicates. We describe the essential multimedia retrieval semantics, compare these with the known approaches, and propose a semantics which captures the requirements of multimedia retrieval problem. We then build on these results in answering the related problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, finding an efficient way to process the query.' We develop an algorithm to efficiently process queries with unordered fuzzy predicates (sub-queries). Although this algorithm can work with different fuzzy semantics, it benefits from the statistical properties of the semantics proposed in this paper. We also present experimental results for evaluating the proposed algorithm in terms of quality of results and search space reduction.",
author = "Kasim Candan and Li, {Wen Syan} and {Lakshmi Priya}, M.",
year = "2000",
month = "12",
doi = "10.1016/S0169-023X(00)00025-2",
language = "English (US)",
volume = "35",
pages = "259--298",
journal = "Data and Knowledge Engineering",
issn = "0169-023X",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Similarity-based ranking and query processing in multimedia databases

AU - Candan, Kasim

AU - Li, Wen Syan

AU - Lakshmi Priya, M.

PY - 2000/12

Y1 - 2000/12

N2 - Since media-based evaluation yields similarity values, results to a multimedia database query, Q(Y1, ..., Yn), is defined as an ordered list SQ of n-tuples of the form 〈X1, ..., Xn〉. The query Q itself is composed of a set of fuzzy and crisp predicates, constants, variables, and conjunction, disjunction, and negation operators. Since many multimedia applications require partial matches, SQ includes results which do not satisfy all predicates. Due to the ranking and partial match requirements, traditional query processing techniques do not apply to multimedia databases. In this paper, we first focus on the problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, providing the user with a meaningful final ranking'. More specifically, we study the problem of merging similarity values in queries with multiple fuzzy predicates. We describe the essential multimedia retrieval semantics, compare these with the known approaches, and propose a semantics which captures the requirements of multimedia retrieval problem. We then build on these results in answering the related problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, finding an efficient way to process the query.' We develop an algorithm to efficiently process queries with unordered fuzzy predicates (sub-queries). Although this algorithm can work with different fuzzy semantics, it benefits from the statistical properties of the semantics proposed in this paper. We also present experimental results for evaluating the proposed algorithm in terms of quality of results and search space reduction.

AB - Since media-based evaluation yields similarity values, results to a multimedia database query, Q(Y1, ..., Yn), is defined as an ordered list SQ of n-tuples of the form 〈X1, ..., Xn〉. The query Q itself is composed of a set of fuzzy and crisp predicates, constants, variables, and conjunction, disjunction, and negation operators. Since many multimedia applications require partial matches, SQ includes results which do not satisfy all predicates. Due to the ranking and partial match requirements, traditional query processing techniques do not apply to multimedia databases. In this paper, we first focus on the problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, providing the user with a meaningful final ranking'. More specifically, we study the problem of merging similarity values in queries with multiple fuzzy predicates. We describe the essential multimedia retrieval semantics, compare these with the known approaches, and propose a semantics which captures the requirements of multimedia retrieval problem. We then build on these results in answering the related problem of `given a multimedia query which consists of multiple fuzzy and crisp predicates, finding an efficient way to process the query.' We develop an algorithm to efficiently process queries with unordered fuzzy predicates (sub-queries). Although this algorithm can work with different fuzzy semantics, it benefits from the statistical properties of the semantics proposed in this paper. We also present experimental results for evaluating the proposed algorithm in terms of quality of results and search space reduction.

UR - http://www.scopus.com/inward/record.url?scp=0343878030&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0343878030&partnerID=8YFLogxK

U2 - 10.1016/S0169-023X(00)00025-2

DO - 10.1016/S0169-023X(00)00025-2

M3 - Article

VL - 35

SP - 259

EP - 298

JO - Data and Knowledge Engineering

JF - Data and Knowledge Engineering

SN - 0169-023X

IS - 3

ER -