Indexación y consultas para bases de datos no convencionales
暂无分享,去创建一个
Susana Cecilia Esquivel | Alejandro Grosso | Nora Susana Reyes | Verónica Ludueña | Gonzalo Navarro | Jorge Arroyuelo
[1] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[2] Neil Immerman,et al. Descriptive and Computational Complexity , 1989, FCT.
[3] Nora Reyes,et al. Solving similarity joins and range queries in metric spaces with the list of twin clusters , 2009, J. Discrete Algorithms.
[4] Christos Faloutsos,et al. Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[5] Pavel Zezula,et al. Similarity Join in Metric Spaces , 2003, ECIR.
[6] Gonzalo Navarro,et al. Fully Dynamic Spatial Approximation Trees , 2002, SPIRE.
[7] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[8] Ronald Fagin. Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .
[9] Gonzalo Navarro. Searching in metric spaces by spatial approximation , 2002, The VLDB Journal.
[10] ManziniGiovanni. An analysis of the BurrowsWheeler transform , 2001 .
[11] Francesco Camastra,et al. Data dimensionality estimation methods: a survey , 2003, Pattern Recognit..
[12] Anuj Dawar. A Restricted Second Order Logic for Finite Structures , 1998, Inf. Comput..
[13] Neil Immerman,et al. Descriptive Complexity , 1999, Graduate Texts in Computer Science.