메뉴 건너뛰기




Volumn 4, Issue 2, 2010, Pages 46-57

Distributed threshold querying of general functions by a difference of monotonic representation

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DIGITAL STORAGE; OBJECT DETECTION;

EID: 84862656283     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1921071.1921072     Document Type: Article
Times cited : (21)

References (39)
  • 1
    • 85039691463 scopus 로고    scopus 로고
    • http://gregsadetsky.com/aol-data/.
  • 2
    • 85039682436 scopus 로고    scopus 로고
    • http://www.netflix.com/.
  • 3
    • 28444484619 scopus 로고    scopus 로고
    • Progressive distributed top-k retrieval in peer-to-peer networks
    • W. T. Balke, W. Nejdl, W. Siberski, and U. Thaden. Progressive distributed top-k retrieval in peer-to-peer networks. In ICDE Conf., pages 174-185, 2005.
    • (2005) ICDE Conf. , pp. 174-185
    • Balke, W.T.1    Nejdl, W.2    Siberski, W.3    Thaden, U.4
  • 5
    • 10444257928 scopus 로고    scopus 로고
    • Efficient top-k query calculation in distributed networks
    • P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In PODC Conf., pages 206-215, 2004.
    • (2004) PODC Conf. , pp. 206-215
    • Cao, P.1    Wang, Z.2
  • 6
    • 19544373409 scopus 로고    scopus 로고
    • A framework for learning from distributed data using sufficient statistics and its application to learning decision trees
    • D. Caragea, A. Silvescu, and V. Honavar. A framework for learning from distributed data using sufficient statistics and its application to learning decision trees. Int. J. Hybrid Intell. Syst., 1(2):80-89, 2004.
    • (2004) Int. J. Hybrid Intell. Syst. , vol.1 , Issue.2 , pp. 80-89
    • Caragea, D.1    Silvescu, A.2    Honavar, V.3
  • 8
    • 0036372482 scopus 로고    scopus 로고
    • Minimal probing: Supporting expensive predicates for top-k queries
    • K. C.-C. Chang and S. won Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD Conf., pages 346-357, 2002.
    • (2002) SIGMOD Conf. , pp. 346-357
    • Chang, K.C.-C.1    won Hwang, S.2
  • 9
    • 84958976005 scopus 로고    scopus 로고
    • Effect of data skewness in parallel mining of association rules
    • D. W.-L. Cheung and Y. Xiao. Effect of data skewness in parallel mining of association rules. In PAKDD Conf., pages 48-60, 1998.
    • (1998) PAKDD Conf. , pp. 48-60
    • Cheung, D.W.-L.1    Xiao, Y.2
  • 10
    • 78650416832 scopus 로고    scopus 로고
    • Randomized multi-pass streaming skyline algorithms
    • A. Das Sarma, A. Lall, D. Nanongkai, and J. Xu. Randomized multi-pass streaming skyline algorithms. Proc. VLDB Endow., 2(1):85-96, 2009.
    • (2009) Proc. VLDB Endow. , vol.2 , Issue.1 , pp. 85-96
    • Das Sarma, A.1    Lall, A.2    Nanongkai, D.3    Xu, J.4
  • 11
    • 0034819889 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS Conf., pages 102-113, 2001.
    • (2001) PODS Conf. , pp. 102-113
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 12
    • 19544380393 scopus 로고    scopus 로고
    • Communication efficient construction of decision trees over heterogeneously distributed data
    • C. Giannella, K. Liu, T. Olsen, and H. Kargupta. Communication efficient construction of decision trees over heterogeneously distributed data. In ICDM Conf., pages 67-74, 2004.
    • (2004) ICDM Conf. , pp. 67-74
    • Giannella, C.1    Liu, K.2    Olsen, T.3    Kargupta, H.4
  • 13
    • 33750439492 scopus 로고    scopus 로고
    • Algorithms and analyses for maximal vector computation
    • P. Godfrey, R. Shipley, and J. Gryz. Algorithms and analyses for maximal vector computation. VLDB Journal, 16(1):5-28, 2007.
    • (2007) VLDB Journal , vol.16 , Issue.1 , pp. 5-28
    • Godfrey, P.1    Shipley, R.2    Gryz, J.3
  • 16
    • 36949039106 scopus 로고    scopus 로고
    • A wakeup call for internet monitoring systems: The case for distributed triggers
    • A. Jain, J. M. Hellerstein, S. Ratnasamy, and D. Wetherall. A wakeup call for internet monitoring systems: The case for distributed triggers. In HotNets Workshop, 2004.
    • (2004) HotNets Workshop
    • Jain, A.1    Hellerstein, J.M.2    Ratnasamy, S.3    Wetherall, D.4
  • 17
    • 34250622521 scopus 로고    scopus 로고
    • Communication-efficient distributed monitoring of thresholded counts
    • R. Keralapura, G. Cormode, and J. Ramamirtham. Communication-efficient distributed monitoring of thresholded counts. In SIGMOD, pages 289-300, 2006.
    • (2006) SIGMOD , pp. 289-300
    • Keralapura, R.1    Cormode, G.2    Ramamirtham, J.3
  • 18
    • 23944480086 scopus 로고    scopus 로고
    • Shooting stars in the sky: an online algorithm for skyline queries
    • D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: an online algorithm for skyline queries. In VLDB Conf., pages 275-286, 2002.
    • (2002) VLDB Conf. , pp. 275-286
    • Kossmann, D.1    Ramsak, F.2    Rost, S.3
  • 19
    • 21844451952 scopus 로고    scopus 로고
    • Diagnosing network-wide traffic anomalies
    • A. Lakhina, M. Crovella, and C. Diot. Diagnosing network-wide traffic anomalies. In SIGCOMM Conf., pages 219-230, 2004.
    • (2004) SIGCOMM Conf. , pp. 219-230
    • Lakhina, A.1    Crovella, M.2    Diot, C.3
  • 20
    • 84876811202 scopus 로고    scopus 로고
    • Rcv1: A new benchmark collection for text categorization research
    • D. D. Lewis, Y. Yang, T. G. Rose, and F. Li. Rcv1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 5(4):361-397, 2004.
    • (2004) Journal of Machine Learning Research , vol.5 , Issue.4 , pp. 361-397
    • Lewis, D.D.1    Yang, Y.2    Rose, T.G.3    Li, F.4
  • 21
    • 0036211203 scopus 로고    scopus 로고
    • Evaluating top-k queries over web-accessible databases
    • A. Marian, N. Bruno, and L. Gravano. Evaluating top-k queries over web-accessible databases. In ICDE Conf., pages 369-381, 2002.
    • (2002) ICDE Conf. , pp. 369-381
    • Marian, A.1    Bruno, N.2    Gravano, L.3
  • 22
    • 33744898753 scopus 로고    scopus 로고
    • Klee: a framework for distributed top-k query algorithms
    • S. Michel, P. Triantafillou, and G. Weikum. Klee: a framework for distributed top-k query algorithms. In VLDB Conf., pages 637-648, 2005.
    • (2005) VLDB Conf. , pp. 637-648
    • Michel, S.1    Triantafillou, P.2    Weikum, G.3
  • 23
    • 33646814378 scopus 로고    scopus 로고
    • Minerva∞: A scalable efficient peer-to-peer search engine
    • S. Michel, P. Triantafillou, and G. Weikum. Minerva∞: A scalable efficient peer-to-peer search engine. In Middleware, pages 60-81, 2005.
    • (2005) Middleware , pp. 60-81
    • Michel, S.1    Triantafillou, P.2    Weikum, G.3
  • 24
    • 1142291592 scopus 로고    scopus 로고
    • Adaptive filters for continuous queries over distributed data streams
    • C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. In SIGMOD Conf., pages 563-574, 2003.
    • (2003) SIGMOD Conf. , pp. 563-574
    • Olston, C.1    Jiang, J.2    Widom, J.3
  • 25
    • 23944477932 scopus 로고    scopus 로고
    • Progressive skyline computation in database systems
    • D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. ACM Trans. Database Syst., 30(1):41-82, 2005.
    • (2005) ACM Trans. Database Syst. , vol.30 , Issue.1 , pp. 41-82
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 26
    • 24344497209 scopus 로고    scopus 로고
    • Distributed data mining: Algorithms, systems, and applications
    • B.-H. Park and H. Kargupta. Distributed data mining: Algorithms, systems, and applications. Lawrence Erlbaum Associates, 2002.
    • (2002) Lawrence Erlbaum Associates
    • Park, B.-H.1    Kargupta, H.2
  • 27
    • 79952679708 scopus 로고    scopus 로고
    • Extreme data mining
    • ACM
    • S. Ramaswamy. Extreme data mining. In SIGMOD Conf., pages 1-2. ACM, 2008.
    • (2008) SIGMOD Conf. , pp. 1-2
    • Ramaswamy, S.1
  • 28
    • 0142253936 scopus 로고    scopus 로고
    • The Reuters Corpus Volume 1 - from Yesterday's News to Tomorrow's Language Resources
    • T. Rose, M. Stevenson, and M. Whitehead. The Reuters Corpus Volume 1 - from Yesterday's News to Tomorrow's Language Resources. In LREC conf., pages 29-31, 2002.
    • (2002) LREC conf. , pp. 29-31
    • Rose, T.1    Stevenson, M.2    Whitehead, M.3
  • 29
    • 0038968611 scopus 로고    scopus 로고
    • Communication-efficient distributed mining of association rules
    • A. Schuster and R. Wolff. Communication-efficient distributed mining of association rules. In SIGMOD Conf., pages 473-484, 2001.
    • (2001) SIGMOD Conf. , pp. 473-484
    • Schuster, A.1    Wolff, R.2
  • 30
    • 36949013219 scopus 로고    scopus 로고
    • A geometric approach to monitoring threshold functions over distributed data streams
    • I. Sharfman, A. Schuster, and D. Keren. A geometric approach to monitoring threshold functions over distributed data streams. ACM Trans. Database Syst., 32(4), 2007.
    • (2007) ACM Trans. Database Syst. , vol.32 , Issue.4
    • Sharfman, I.1    Schuster, A.2    Keren, D.3
  • 31
    • 57349119892 scopus 로고    scopus 로고
    • Shape sensitive geometric monitoring
    • I. Sharfman, A. Schuster, and D. Keren. Shape sensitive geometric monitoring. In PODS Conf., pages 301-310, 2008.
    • (2008) PODS Conf. , pp. 301-310
    • Sharfman, I.1    Schuster, A.2    Keren, D.3
  • 33
    • 0344756892 scopus 로고    scopus 로고
    • Efficient progressive skyline computation
    • K.-L. Tan, P.-K. Eng, and B. C. Ooi. Efficient progressive skyline computation. In VLDB Conf., pages 301-310, 2001.
    • (2001) VLDB Conf. , pp. 301-310
    • Tan, K.-L.1    Eng, P.-K.2    Ooi, B.C.3
  • 34
    • 35448935270 scopus 로고    scopus 로고
    • Progressive and selective merge: computing top-k with ad-hoc ranking functions
    • D. Xin, J. Han, and K. C.-C. Chang. Progressive and selective merge: computing top-k with ad-hoc ranking functions. In SIGMOD Conf., pages 103-114, 2007.
    • (2007) SIGMOD Conf. , pp. 103-114
    • Xin, D.1    Han, J.2    Chang, K.C.-C.3
  • 35
    • 12244275963 scopus 로고    scopus 로고
    • Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs
    • H. Xiong, S. Shekhar, P.-N. Tan, and V. Kumar. Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs. In KDD, pages 334-343, 2004.
    • (2004) KDD , pp. 334-343
    • Xiong, H.1    Shekhar, S.2    Tan, P.-N.3    Kumar, V.4
  • 36
    • 26844557807 scopus 로고    scopus 로고
    • Efficient processing of distributed top-k queries
    • H. Yu, H.-G. Li, P. Wu, D. Agrawal, and A. E. Abbadi. Efficient processing of distributed top-k queries. In DEXA Conf., pages 65-74, 2005.
    • (2005) DEXA Conf. , pp. 65-74
    • Yu, H.1    Li, H.-G.2    Wu, P.3    Agrawal, D.4    Abbadi, A.E.5
  • 37
    • 34547636852 scopus 로고    scopus 로고
    • Finding highly correlated pairs efficiently with powerful pruning
    • J. Zhang and J. Feigenbaum. Finding highly correlated pairs efficiently with powerful pruning. In CIKM Conf., pages 152-161, 2006.
    • (2006) CIKM Conf. , pp. 152-161
    • Zhang, J.1    Feigenbaum, J.2
  • 39
    • 34250634879 scopus 로고    scopus 로고
    • Finding global icebergs over distributed data sets
    • Q. Zhao, M. Ogihara, H. Wang, and J. Xu. Finding global icebergs over distributed data sets. In PODS Conf., pages 298-307, 2006.
    • (2006) PODS Conf. , pp. 298-307
    • Zhao, Q.1    Ogihara, M.2    Wang, H.3    Xu, J.4


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