메뉴 건너뛰기




Volumn , Issue , 2003, Pages 117-128

Distributed top-N query processing with possibly uncooperative local systems

Author keywords

Distributed databases; Query processing; Top N queries

Indexed keywords

QUERY LANGUAGES; QUERY PROCESSING;

EID: 85012124642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-012722442-8/50019-7     Document Type: Conference Paper
Times cited : (48)

References (24)
  • 3
    • 0001906076 scopus 로고    scopus 로고
    • Reducing the braking distance of an SQL query engine
    • M. Carey and D. Kossmann. Reducing the Braking Distance of an SQL Query Engine. VLDB Conference, 1998.
    • (1998) VLDB Conference
    • Carey, M.1    Kossmann, D.2
  • 5
    • 0039562903 scopus 로고    scopus 로고
    • Independence is good: Dependency-based histogram synopses for high dimensional data
    • A. Deshpande, M. Garofalakis and R. Rastogi. Independence is good: Dependency-Based Histogram Synopses for High Dimensional Data. SIGMOD Conference, 2001.
    • (2001) SIGMOD Conference
    • Deshpande, A.1    Garofalakis, M.2    Rastogi, R.3
  • 7
    • 0034215869 scopus 로고    scopus 로고
    • Dynamic VP tree indexing for N-nearest neighbor search given pairwise distances
    • A. Fu, P. Chan, Cheung Y and Moon, Y. Dynamic VP tree indexing for N-nearest neighbor search given pairwise distances, VLDB Journal, 2000.
    • (2000) VLDB Journal
    • Fu, A.1    Chan, P.2    Cheung, Y.3    Moon, Y.4
  • 8
    • 84994131520 scopus 로고    scopus 로고
    • Merging ranks from heterogeneous internet sources
    • L. Gravano, and Garcia-Molina, H. Merging ranks from heterogeneous internet sources. VLDB Conference, 1997.
    • (1997) VLDB Conference
    • Gravano, L.1    Garcia-Molina, H.2
  • 11
    • 0002131606 scopus 로고    scopus 로고
    • Histogram-based approximation of set-valued query answers
    • Y. Ioannidis and V. Poosala. Histogram-based Approximation of Set-valued Query Answers. VLDB Conference, 1999.
    • (1999) VLDB Conference
    • Ioannidis, Y.1    Poosala, V.2
  • 12
    • 52949104320 scopus 로고    scopus 로고
    • Preference SQL - Design, implementation, experiences
    • W. Kiessling, G. Koestler. Preference SQL - Design, Implementation, Experiences. VLDB Conference, 2002.
    • (2002) VLDB Conference
    • Kiessling, W.1    Koestler, G.2
  • 13
    • 0012313278 scopus 로고    scopus 로고
    • Combining histograms and parametric curve fitting for feedback-driven query result-size estimation
    • A. Konig and G. Weikum. Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-Size Estimation. VLDB Conference, 1999.
    • (1999) VLDB Conference
    • Konig, A.1    Weikum, G.2
  • 14
    • 0028405250 scopus 로고
    • G-tree: A new data structure for organizing multidimensional data
    • April
    • A. Kumar. G-Tree: A New Data Structure for Organizing Multidimensional Data. IEEE TKDE, 6(2), April 1994.
    • (1994) IEEE TKDE , vol.6 , Issue.2
    • Kumar, A.1
  • 16
    • 34147137890 scopus 로고    scopus 로고
    • Querying heterogeneous information sources using source descriptions
    • A. Levy, A. Rajaraman, and J. Ordille. Querying Heterogeneous Information Sources Using Source Descriptions. VLDB Conference, 1996.
    • (1996) VLDB Conference
    • Levy, A.1    Rajaraman, A.2    Ordille, J.3
  • 18
    • 84944037385 scopus 로고
    • Equi-depth histograms for estimating selectivity factors for multi-dimensional queries
    • M. Muralikrishna and D. J. DeWitt. Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries. ACM SIGMOD Conference, 1988.
    • (1988) ACM SIGMOD Conference
    • Muralikrishna, M.1    DeWitt, D.J.2
  • 19
    • 84994070713 scopus 로고    scopus 로고
    • Selectivity estimation without the attribute value independence assumption
    • V. Poosala and Y. Ioannidis. Selectivity Estimation Without the Attribute Value Independence assumption. VLDB Conference, 1997.
    • (1997) VLDB Conference
    • Poosala, V.1    Ioannidis, Y.2
  • 20
    • 0016917230 scopus 로고
    • On self-organizing sequential search heuristics
    • R. Rivest. On Self-Organizing Sequential Search Heuristics. CACM 19(2):63-67, 1976.
    • (1976) CACM , vol.19 , Issue.2 , pp. 63-67
    • Rivest, R.1
  • 22
    • 0034819224 scopus 로고    scopus 로고
    • Efficient and effective metasearch for text databases incorporating linkages among documents
    • May
    • C. Yu, W. Meng, W. Wu, K. Liu. Efficient and Effective Metasearch for Text Databases Incorporating Linkages among Documents. ACM SIGMOD Conference, May 2001.
    • (2001) ACM SIGMOD Conference
    • Yu, C.1    Meng, W.2    Wu, W.3    Liu, K.4
  • 23
    • 84901283922 scopus 로고    scopus 로고
    • Databases selection for processing k nearest neighbors queries in distributed environments
    • C. Yu, P. Sharma, W. Meng and Y. Qin. Databases Selection for Processing k Nearest Neighbors Queries in Distributed Environments. 1st ACM/IEEE-CS joint conf. on DL, 2001.
    • (2001) 1st ACM/IEEE-CS Joint Conf. on DL
    • Yu, C.1    Sharma, P.2    Meng, W.3    Qin, Y.4


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