Shaibal Roy
- AGA90.Khaled A. g. Abdel-Ghaffar and Amr E1 Abbadi. Optimal disk allocation for partial match queries. Unpublished Manuscript, 1990.Google Scholar
- AST90.Martin Anthony and John Shawe-Taylor. A result of vapnik with applications. Technical report, Royal Holloway and Bedford New College, UK, 1990.Google Scholar
- BEHW89.Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervnenkis dimension. Journal of the A CM, 36(4), October 1989. Google ScholarDigital Library
- Che52.Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of MaYbe. matical Stagistics, 23, 1952.Google Scholar
- CLR90.Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass., 1990. Google ScholarDigital Library
- CW79.J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. Journal of Computers and Systems Sciences, 18(2), 1979.Google Scholar
- DGS+90.David J. DeWitt, Shahram Ghandeharizadeh, Donovan Schneider, Allan Bricker, Hui-I Hsiao, and Rick Rasmussen. The gamma database project. IEEE Transacgions on Knowlege and Daga Engineering, 2(1), March 1990. Google ScholarDigital Library
- Dud84.R.M. Dudley. An course in empirical processes. In Lecture No#es in Mathematics, Vol. 1097. Springer-Verlag, 1984.Google ScholarCross Ref
- FKS84.Michael L. Fredman, J anos Komlos, and Endre Szemeredi. Storing a sparse table with o(1) worst case access time. Journal of #he A CM, 31(3), July 1984. Google ScholarDigital Library
- FM89.C. Faloutsos and D. Metaxas. Declustering using error correcting codes. In Proceedings of the 1989 A CM SIGA CT- SIGMOD-SIGART Symposium on Principles of Database Systems, March 1989. Google ScholarDigital Library
- Gha90.Shahram Ghandeharizadeh. Physical Database Design in Mult@rocessot Database Systems. PhD thesis, Department of Computer Science, University of Wisconsin-Madison, September 90. Google ScholarDigital Library
- Gro88.Tandem Performance Group. A benchmark of non-stop sql on the debit credit transaction. in SIGMOD-88 {SIC88}. Google ScholarDigital Library
- HW87.David Haussler and Emo Welzl. Epsilonnets and simplex range queries. Discrete Computational Geometry, 2, 1987.Google Scholar
- KP88.M.H. Kim and S. Pramanik. Optimal file distribution for partial match retrieval. In SIGMOD-88 {SIG88}. Google ScholarDigital Library
- KU86.Anna R. Karlin and Eli Upfal. Parallel hashing- an efficient implementation of shared memory. In Proceedings of the 1986 Annual A CM Symposium on Theory of Computing, 1986. Google ScholarDigital Library
- P+85.G.F. Pfister et al. The ibm research parallel processor prototype (rp3): introduction and architecture. In Proceedings of #he 1985 Internagional Conference on Parallel Processing, August 1985.Google Scholar
- SIG88.Proceedings of the 1988 A CM SIGMOD Ingernational Conference on Management of Daga, 1988.Google Scholar
- Ter85.Teradata Corporation. DBC/IOlZ Database Computer System Manual Release 2.0, 1985.Google Scholar
- Vap82.Vladimir Vapnik. Estimalion of Dependences Based on Empirical Da$a. Springer- Verlag, 1982. Google ScholarDigital Library
- VC71.V.N. Vapnik and A. YA. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and i#s Applications, XVI(2), 1971.Google Scholar
Index Terms
- Semantic complexity of classes of relational queries and query independent data partitioning
Recommendations
Structure and complexity of relational queries
SFCS '80: Proceedings of the 21st Annual Symposium on Foundations of Computer ScienceThis paper is an attempt at laying the foundations for the classification of queries on relational data bases according to their structure and their computational complexity. Using the operations of composition and fixpoints, a Σ-Π hierarchy of height, ...
Information retrieval from relational databases using semantic queries
CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge managementRelational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end users. There is often a semantic gap between the queries users want to ...
Data complexity of query answering in description logics
KR'06: Proceedings of the Tenth International Conference on Principles of Knowledge Representation and ReasoningIn this paper we study data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by an ABox and a TBox. In particular, we are interested in characterizing the FOL-reducibility and the polynomial tractability ...
Comments