Vasilis Samoladas
- 1.L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In FOGS '96; 87th Annual Symposium on Foundations of Computer Sci. ence, pages 560-569. IEEE, October 1996. Google Scholar
Digital Library
- 2.Don Batory and Jeff Thomas. P2: A lightweight DBMS generator. Technical Report TR-95-26, University of Texas at Austin, Department of Computer Sciences, June 1995. Google Scholar
- 3.Don S. Batory, J. R. Barnett, 3. F. Garza, K. P. Smith, K. Tsukuda, B. C. Twochell, and T. E. Wise. Genesis: A reconfigurable database management system. Technical Report CS-TR-86-07, University of Texas, Austin, March 1, 1986. Google Scholar
- 4.K. J, Falconer. Fractal geometry : mathematical.foundations and applications. Wiley, 1990.Google Scholar
- 5.(3, Faloutsos and I. Kamd. Beyond uniformity glad independence: Analysis of R- trees using the concept of fraetal dimension. In 13th Symposium- 1994 May: Minneapolis; MN, PROCEEDINGS OF THE ACM SIGACT SIGMOD SIGART SYMPOSIUM ON PRIN- CIPLES OF DATABASE SYSTEMS 1994, pages 4-13, 1994. Google ScholarDigital Library
- 6.Volker Gaede and Oliver Guenther. Multidimensional access methods. Technical Report TR-96-043, International Computer Science Institute, Berkeley, CA, October 1996,Google Scholar
- 7.J.M. Hellersteln, E. Koutsoupias, and C.H. Papadimitriou. On the analysis of indexing schemes. In Proceedings o} the Sixteenth A GM SIGA GT.SIGMOD- SIGART Symposium on Principles of Database Systems (~'OZ)S), 1997. Google ScholarDigital Library
- 8.J,M. Hellerstein, J.E. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proceedings of the $ist VLDB Conference, 1995. Google ScholarDigital Library
- 9.P, O, Kanellakis, S. Ramaswamy, D. Vengroff, E., and J, S, Vitter. indexing for data models with constraints and classes. In Proceedings of the Twelfth A CM SIGAOT.SIGMOD.SIGART Symposium on Principles of Databaae Systems: May ~5-~8, 1998, Washington, DG, volume 12, pages 233--243, 1993. Google ScholarDigital Library
- 10.E, Koutsoupias and David S. Taylor. Tight bounds for 2-dimensional indexing schemes. In Proceedings of Symposium on Principles of Database Systems (PODS), 1998, Google ScholarDigital Library
- 11.TI1, Lengauer. VLSI theory. In Handbook of Theoreti. cal Computer Science, Ed. Jan van Leeuwen, (Volume A: Algorithms and Complexity), volume 1. Elsevier and MIT Press~ 1990. Google ScholarDigital Library
- 12.M, H, Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph searching. In Proceedings of the Twelfth A GM SIGA CT.SIGMOD.SIGART Symposium on Principles of Database Systems: May 25-28, 1993, Washington, DC, pages 222-232, 1993. Google ScholarDigital Library
- 13.S. Ramaswamy and P. C. Kanellakis. OODB indexing by class-divislon. SIGMOD Record (ACM Special Interest Group on Management of Data), 24(2):139--150, June 1995. Google ScholarDigital Library
- 14.S. Ramaswamy and S. Subramanian. Path cach~g: A technique for optimal external searching. In 13th Sym. poaium .-- 199.~ May: Minneapolis; MN, volume 13 of PROOEEDINGS OF THE A GM SIGA GT SIG- MOD SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS 1994, pages 25-35, 1994. Google ScholarDigital Library
- 15.S, Sarawagi and M. Stonebraker. Efficient organization of large multidimensional arrays. In Proceedings of the 1 Otis international Conference on Data Engineering, pages 328-336~ February 1994. Google ScholarDigital Library
- 16.Salram Subramanlan and Sridhar Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proceedings of the 6th Annual C3ymposium on Discrete Algorithms, pages 378- 387, January 1995. Google ScholarDigital Library
- 17.Darren Erick Vengroff and Jeffrey Scott Vitter. Efficient 3-D range searching; in external memory. In Proceedings of the Twenty-Eighth Annual A GM Symposium on Theory of Computing, pages 192-201, 22-24 May 1996. Google ScholarDigital Library
- 18.M. Yannalmkis. Perspectives on database theory. In FOGS: IEEE Symposium on Foundations of Computer Science (FOGS), 1995. Google ScholarDigital Library
- 19.Y. Zhao, P.M. Deshpande, and J.F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In Proc. of the 1997 A C,M SIGMOD Conf. on Management of Data, pages 159-170, May 1997. Google ScholarDigital Library
Index Terms
- A lower bound theorem for indexing schemes and its application to multidimensional range queries
Recommendations
Secure multidimensional range queries over outsourced data
In this paper, we study the problem of supporting multidimensional range queries on encrypted data. The problem is motivated by secure data outsourcing applications where a client may store his/her data on a remote server in encrypted form and want to ...
Inverse queries for multidimensional spaces
SSTD'11: Proceedings of the 12th international conference on Advances in spatial and temporal databasesTraditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database ...
Range queries on uncertain data
Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query ...
Comments