The search functionality is under construction.

The search functionality is under construction.

Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper. Let *s* be the number of objects in each set and *n* be the number of objects in the database. The number of sets in the database amounts to * _{n}C_{s}*. We propose an efficient algorithm to compute convex skyline of the

- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.10 pp.2709-2716

- Publication Date
- 2010/10/01

- Publicized

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.E93.D.2709

- Type of Manuscript
- Special Section PAPER (Special Section on Data Mining and Statistical Science)

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Md. Anisuzzaman SIDDIQUE, Yasuhiko MORIMOTO, "Algorithm for Computing Convex Skyline Objectsets on Numerical Databases" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 10, pp. 2709-2716, October 2010, doi: 10.1587/transinf.E93.D.2709.

Abstract: Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper. Let *s* be the number of objects in each set and *n* be the number of objects in the database. The number of sets in the database amounts to * _{n}C_{s}*. We propose an efficient algorithm to compute convex skyline of the

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.2709/_p

Copy

@ARTICLE{e93-d_10_2709,

author={Md. Anisuzzaman SIDDIQUE, Yasuhiko MORIMOTO, },

journal={IEICE TRANSACTIONS on Information},

title={Algorithm for Computing Convex Skyline Objectsets on Numerical Databases},

year={2010},

volume={E93-D},

number={10},

pages={2709-2716},

abstract={Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper. Let *s* be the number of objects in each set and *n* be the number of objects in the database. The number of sets in the database amounts to * _{n}C_{s}*. We propose an efficient algorithm to compute convex skyline of the

keywords={},

doi={10.1587/transinf.E93.D.2709},

ISSN={1745-1361},

month={October},}

Copy

TY - JOUR

TI - Algorithm for Computing Convex Skyline Objectsets on Numerical Databases

T2 - IEICE TRANSACTIONS on Information

SP - 2709

EP - 2716

AU - Md. Anisuzzaman SIDDIQUE

AU - Yasuhiko MORIMOTO

PY - 2010

DO - 10.1587/transinf.E93.D.2709

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E93-D

IS - 10

JA - IEICE TRANSACTIONS on Information

Y1 - October 2010

AB - Given a set of objects, a skyline query finds the objects that are not dominated by others. We consider a skyline query for sets of objects in a database in this paper. Let *s* be the number of objects in each set and *n* be the number of objects in the database. The number of sets in the database amounts to * _{n}C_{s}*. We propose an efficient algorithm to compute convex skyline of the

ER -