Towards efficient dominant relationship exploration of the product items on the web

Authors:
Zhenglu Yang;Lin Li;Botao Wang;Masaru Kitsuregawa
Affiliations:
Dept. of Info. and Comm. Engineering, University of Tokyo, Meguro-ku, Tokyo, Japan;Dept. of Info. and Comm. Engineering, University of Tokyo, Meguro-ku, Tokyo, Japan;Dept. of Info. and Comm. Engineering, University of Tokyo, Meguro-ku, Tokyo, Japan;Dept. of Info. and Comm. Engineering, University of Tokyo, Meguro-ku, Tokyo, Japan
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 17
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
Global partial orders from sequential data

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Faceted metadata for image search and browsing

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth

Proceedings of the 17th International Conference on Data Engineering
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
An optimal and progressive algorithm for skyline queries

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The complexity of mining maximal frequent itemsets and maximal frequent patterns

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient computation of the skyline cube

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Catching the best views of skyline: a semantic approach based on decisive subspaces

VLDB '05 Proceedings of the 31st international conference on Very large data bases
DADA: a data cube for dominant relationship analysis

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
General dominant relationship analysis based on partial order models

Proceedings of the 2007 ACM symposium on Applied computing
Shooting stars in the sky: an online algorithm for skyline queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Efficient querying relaxed dominant relationship between product items based on rank aggregation

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which define a natural graph structure that yields a good ranking. Unfortunately, current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data (i.e., find the "best" items), we propose an integrated online system consisting of compressed data structure to encode the dominant relationship of the relational data. Efficient querying strategies and updating scheme are devised to facilitate the ranking process. Extensive experiments illustrate the effectiveness and efficiency of our methods. As such, we believe the work in this paper can be complementary to traditional search engines.