메뉴 건너뛰기




Volumn , Issue , 2000, Pages 236-243

Interactive exploration of very large relational datasets through 3D dynamic projections

Author keywords

Design; Experimentation

Indexed keywords

COSTS; INDEXING (OF INFORMATION); QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; VIRTUAL REALITY;

EID: 0034593062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/347090.347134     Document Type: Conference Paper
Times cited : (21)

References (18)
  • 1
    • 0000835612 scopus 로고
    • The grand tour: A tool for viewing multidimensional data
    • Jan.
    • D. Asimov. The grand tour: A tool for viewing multidimensional data. SIAM Journal of Science and Statistical Computing, 6(1):128-143, Jan. 1985.
    • (1985) SIAM Journal of Science and Statistical Computing , vol.6 , Issue.1 , pp. 128-143
    • Asimov, D.1
  • 3
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
    • (1975) Commun. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 7
    • 0026871750 scopus 로고
    • The CAVE audio visual experience automatic virtual environment
    • C. Cruz-Neira, D. J. Sandin, T. DeFanti, R. Kenyon, and H. J, C. The CAVE audio visual experience automatic virtual environment. Commun. ACM, 35(1):64-72, 1992.
    • (1992) Commun. ACM , vol.35 , Issue.1 , pp. 64-72
    • Cruz-Neira, C.1    Sandin, D.J.2    DeFanti, T.3    Kenyon, R.4
  • 9
    • 0016102310 scopus 로고
    • A projection pursuit algorithm for exploratory data analysis
    • J. Friedman and J. Tukey. A projection pursuit algorithm for exploratory data analysis. IEEE Trans. Comput., 23:881-890, 1974.
    • (1974) IEEE Trans. Comput. , vol.23 , pp. 881-890
    • Friedman, J.1    Tukey, J.2
  • 12
    • 85010847034 scopus 로고
    • The K-D-B-tree: A search structure for large multidimensional dynamic indexes
    • Ann Arbor, Michigan, June
    • J. T. Robinson. The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of ACM SIGMOD Conference, pages 10-18, Ann Arbor, Michigan, June 1981.
    • (1981) Proceedings of ACM SIGMOD Conference , pp. 10-18
    • Robinson, J.T.1
  • 15
    • 0013065341 scopus 로고    scopus 로고
    • Exploiting sample-data distributions to reduce the cost of nearest-neighbor searches with kd-trees
    • Proceedings of IDA '99, Springer
    • D. Talbert and D. Fisher. Exploiting sample-data distributions to reduce the cost of nearest-neighbor searches with kd-trees. In Proceedings of IDA '99, LNCS 1642, pages 407-414. Springer, 1999.
    • (1999) LNCS , vol.1642 , pp. 407-414
    • Talbert, D.1    Fisher, D.2
  • 17
    • 0029488555 scopus 로고
    • High dimensional brushing for interactive exploration of multivariate data
    • M. Ward. High dimensional brushing for interactive exploration of multivariate data. In Proceedings of Visualization'95, pages 271-278, 1995.
    • (1995) Proceedings of Visualization'95 , pp. 271-278
    • Ward, M.1
  • 18
    • 0025475506 scopus 로고
    • Footprint evaluation for volume rendering
    • Aug.
    • L. Westover. Footprint evaluation for volume rendering. ACM Computer Graphics, 24(4):367-376, Aug. 1990.
    • (1990) ACM Computer Graphics , vol.24 , Issue.4 , pp. 367-376
    • Westover, L.1


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