메뉴 건너뛰기




Volumn 3, Issue 1, 2010, Pages 1114-1124

Regret-minimizing representative databases

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DECISION MAKING;

EID: 84859255725     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920980     Document Type: Article
Times cited : (118)

References (32)
  • 1
    • 85038450476 scopus 로고    scopus 로고
    • Gnu linear programming kit, version 4.39
    • Gnu linear programming kit, version 4.39,. http://www.gnu.org/software/glpk/glpk.html.
  • 2
    • 84926080684 scopus 로고    scopus 로고
    • Cambridge University Press, September
    • Algorithmic Game Theory. Cambridge University Press, September 2007.
    • (2007) Algorithmic Game Theory
  • 3
    • 0018020828 scopus 로고
    • On the average number of maxima in a set of vectors and applications
    • J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the average number of maxima in a set of vectors and applications. J. ACM, 25(4):536-543, 1978.
    • (1978) J. ACM , vol.25 , Issue.4 , pp. 536-543
    • Bentley, J.L.1    Kung, H.T.2    Schkolnick, M.3    Thompson, C.D.4
  • 10
    • 33748287034 scopus 로고    scopus 로고
    • Approximating convex pareto surfaces in multiobjective radiotherapy planning
    • D. L. Craft, T. F. Halabi, H. A. Shih, and T. R. Bortfeld. Approximating convex pareto surfaces in multiobjective radiotherapy planning. Med. Phys., 33(9):3399-3407, 2006.
    • (2006) Med. Phys. , vol.33 , Issue.9 , pp. 3399-3407
    • Craft, D.L.1    Halabi, T.F.2    Shih, H.A.3    Bortfeld, T.R.4
  • 11
    • 0001489753 scopus 로고
    • Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
    • D. Douglas and T. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer, 10(2):112-122, 1973.
    • (1973) The Canadian Cartographer , vol.10 , Issue.2 , pp. 112-122
    • Douglas, D.1    Peucker, T.2
  • 12
    • 33745628685 scopus 로고    scopus 로고
    • Skyline cardinality for relational processing
    • P. Godfrey. Skyline cardinality for relational processing. In FoIKS, 2004.
    • (2004) FoIKS
    • Godfrey, P.1
  • 13
    • 33750439492 scopus 로고    scopus 로고
    • Algorithms and analyses for maximal vector computation
    • Also appeared in VLDB'05
    • P. Godfrey, R. Shipley, and J. Gryz. Algorithms and analyses for maximal vector computation. VLDB J., 16(1):5-28, 2007. Also appeared in VLDB'05.
    • (2007) VLDB J. , vol.16 , Issue.1 , pp. 5-28
    • Godfrey, P.1    Shipley, R.2    Gryz, J.3
  • 16
    • 0039561510 scopus 로고    scopus 로고
    • Prefer: A system for the efficient execution of multi-parametric ranked queries
    • V. Hristidis, N. Koudas, and Y. Papakonstantinou. Prefer: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD, 2001.
    • (2001) SIGMOD
    • Hristidis, V.1    Koudas, N.2    Papakonstantinou, Y.3
  • 17
    • 55349093583 scopus 로고    scopus 로고
    • A survey of top-k query processing techniques in relational database systems
    • I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008.
    • (2008) ACM Comput. Surv. , vol.40 , Issue.4
    • Ilyas, I.F.1    Beskales, G.2    Soliman, M.A.3
  • 18
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-396, 1984.
    • (1984) Combinatorica , vol.4 , Issue.4 , pp. 373-396
    • Karmarkar, N.1
  • 20
    • 55549137378 scopus 로고    scopus 로고
    • Personalized top-k skyline queries in high-dimensional space
    • J. Lee, G. Won You, and S. Won Hwang. Personalized top-k skyline queries in high-dimensional space. Inf. Syst., 34(1):45-61, 2009.
    • (2009) Inf. Syst. , vol.34 , Issue.1 , pp. 45-61
    • Lee, J.1    Won You, G.2    Won Hwang, S.3
  • 21
    • 70349092550 scopus 로고    scopus 로고
    • Top-k dominating queries in uncertain databases
    • L.C. 0002
    • X. Lian and L. C. 0002. Top-k dominating queries in uncertain databases. In EDBT, 2009.
    • (2009) EDBT
    • Lian, X.1
  • 22
    • 34548740177 scopus 로고    scopus 로고
    • Selecting stars: The k most representative skyline operator
    • X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang. Selecting stars: The k most representative skyline operator. In ICDE, 2007.
    • (2007) ICDE
    • Lin, X.1    Yuan, Y.2    Zhang, Q.3    Zhang, Y.4
  • 23
    • 77954730930 scopus 로고    scopus 로고
    • Discovering relative importance of skyline attributes
    • D. Mindolin and J. Chomicki. Discovering relative importance of skyline attributes. PVLDB, 2(1):610-621, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 610-621
    • Mindolin, D.1    Chomicki, J.2
  • 25
    • 58149415051 scopus 로고
    • An iterative procedure for the polygonal approximation of plane curves
    • U. Ramer. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing, 1(3):244-256, 1972.
    • (1972) Computer Graphics and Image Processing , vol.1 , Issue.3 , pp. 244-256
    • Ramer, U.1
  • 26
    • 0001515078 scopus 로고
    • The convergence rate of the sandwich algorithm for approximating convex functions
    • G. Rote. The convergence rate of the sandwich algorithm for approximating convex functions. Computing, 48(3-4):337-361, 1992.
    • (1992) Computing , vol.48 , Issue.3-4 , pp. 337-361
    • Rote, G.1
  • 27
    • 67649649603 scopus 로고    scopus 로고
    • Distance-based representative skyline
    • Y. Tao, L. Ding, X. Lin, and J. Pei. Distance-based representative skyline. In ICDE, 2009.
    • (2009) ICDE
    • Tao, Y.1    Ding, L.2    Lin, X.3    Pei, J.4
  • 29
    • 52649170778 scopus 로고    scopus 로고
    • On skylining with flexible dominance relation
    • T. Xia, D. Zhang, and Y. Tao. On skylining with flexible dominance relation. In ICDE, 2008.
    • (2008) ICDE
    • Xia, T.1    Zhang, D.2    Tao, Y.3
  • 30
    • 0031076361 scopus 로고    scopus 로고
    • A method for convex curve approximation
    • February
    • X. Q. Yang and C. J. Goh. A method for convex curve approximation. European Journal of Operational Research, 97(1):205-212, February 1997.
    • (1997) European Journal of Operational Research , vol.97 , Issue.1 , pp. 205-212
    • Yang, X.Q.1    Goh, C.J.2
  • 31
    • 67649553758 scopus 로고    scopus 로고
    • Multi-dimensional topdominating queries
    • Also VLDB'07
    • M. L. Yiu and N. Mamoulis. Multi-dimensional topdominating queries. VLDB J., 18(3):695-718, 2009. Also VLDB'07.
    • (2009) VLDB J. , vol.18 , Issue.3 , pp. 695-718
    • Yiu, M.L.1    Mamoulis, N.2
  • 32
    • 77951939498 scopus 로고    scopus 로고
    • Threshold-based Probabilistic Top-k Dominating Queries
    • W. Zhang, X. Lin, Y. Zhang, J. Pei, and W. Wang. Threshold-based Probabilistic Top-k Dominating Queries. VLDB J., 19(2):283-305, 2009.
    • (2009) VLDB J. , vol.19 , Issue.2 , pp. 283-305
    • Zhang, W.1    Lin, X.2    Zhang, Y.3    Pei, J.4    Wang, W.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.