The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dado um conjunto de objetos, uma consulta skyline encontra os objetos que não são dominados por outros. Consideramos uma consulta skyline para conjuntos de objetos em um banco de dados neste artigo. Deixar s seja o número de objetos em cada conjunto e n seja o número de objetos no banco de dados. O número de conjuntos no banco de dados equivale a nCs. Propomos um algoritmo eficiente para calcular o horizonte convexo do nCs conjuntos. Chamamos os conjuntos de objetos do horizonte recuperados como "conjuntos de objetos do horizonte convexo". A avaliação experimental usando conjuntos de dados reais e sintéticos demonstra que a consulta proposta ao conjunto de objetos do horizonte é significativa e escalável o suficiente para lidar com bancos de dados grandes e de alta dimensão. Recentemente, temos que estar atentos à privacidade do indivíduo. Às vezes, temos que ocultar valores individuais e só podemos divulgar valores agregados de objetos. Nessa situação, não podemos usar consultas convencionais de horizonte. A função proposta pode ser uma alternativa promissora na tomada de decisões em um ambiente consciente da privacidade.
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.
Copiar
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 nCs. We propose an efficient algorithm to compute convex skyline of the nCs sets. We call the retrieve skyline objectsets as "convex skyline objectsets". Experimental evaluation using real and synthetic datasets demonstrates that the proposed skyline objectset query is meaningful and is scalable enough to handle large and high dimensional databases. Recently, we have to aware individual's privacy. Sometimes, we have to hide individual values and are only allowed to disclose aggregated values of objects. In such situation, we cannot use conventional skyline queries. The proposed function can be a promising alternative in decision making in a privacy aware environment.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.2709/_p
Copiar
@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 nCs. We propose an efficient algorithm to compute convex skyline of the nCs sets. We call the retrieve skyline objectsets as "convex skyline objectsets". Experimental evaluation using real and synthetic datasets demonstrates that the proposed skyline objectset query is meaningful and is scalable enough to handle large and high dimensional databases. Recently, we have to aware individual's privacy. Sometimes, we have to hide individual values and are only allowed to disclose aggregated values of objects. In such situation, we cannot use conventional skyline queries. The proposed function can be a promising alternative in decision making in a privacy aware environment.},
keywords={},
doi={10.1587/transinf.E93.D.2709},
ISSN={1745-1361},
month={October},}
Copiar
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 nCs. We propose an efficient algorithm to compute convex skyline of the nCs sets. We call the retrieve skyline objectsets as "convex skyline objectsets". Experimental evaluation using real and synthetic datasets demonstrates that the proposed skyline objectset query is meaningful and is scalable enough to handle large and high dimensional databases. Recently, we have to aware individual's privacy. Sometimes, we have to hide individual values and are only allowed to disclose aggregated values of objects. In such situation, we cannot use conventional skyline queries. The proposed function can be a promising alternative in decision making in a privacy aware environment.
ER -