Home page Site map Contact
  

 

Boris Chidlovskii (Shidlovsky)

Xerox Research Centre Europe
6, chemin de Maupertuis
38240 Meylan
FRANCE

Phone: +33 (0)4 76 61 50 25
Fax: +33 (0)4 76 61 50 99
boris.chidlovskii@xrce.xerox.com


Publications before 1997

Books

  1. A.V. Anisimov, Y. Boreisha, P. Kuljabko, S. Semenjuk, V.Oleshchuk, B. Shidlovsky,
    Introduction in Computer Science, Kiev University Publishing, 193 pp., 1993 (in Ukranian).

  2. E. Bertino, B. Ooi, R. Sacks-Davis, K.-L. Tan, J. Zobel, B. Shidlovsky, B. Catania, Indexing Techniques for Advanced Database Systems, Indexing Techniques for Advanced Database Systems Kluwer Academic Publishers, 343 pp., 1997.


Journal Articles and Conference Papers

  1. B. Shidlovsky, New scheme for analysis of random insertions and deletions in 2-3-tree, Modeli i systemy obrabotki informacii, Vol. 6, pp. 21-27, 1987 (in Russian).

  2. B. Shidlovsky, Data allocation in parallel systems, Proc. Caucasian Young Scientists Conference on Information Systems, Erevan, USSR, pp. 35-42, 1987 (in Russian).

  3. B. Shidlovsky, Dictionary problem and VLSI technology, Modeli i systemy obrabotki informacii, Vol.7, pp. 87-97, 1988 (in Russian).

  4. B. Shidlovsky, Time and space complexity of dictionary machines, Modeli i systemy obrabotki informacii, Vol.8, pp. 42-45,1989 (in Russian).

  5. A.V. Anisimov, B. Shidlovsky, Concurrency methods for the dictionary problem : a survey,

    1. Kibernetika, Vol.59(3), pp. 35-46,1989 (in Russian),

    2. Cybernetics, Plenum Publishing Corp., Vol.25, pp.327-340, 1990 (in English).

  6. B. Shidlovsky, Optimistic versus locking approaches to B-trees, Modeli i systemy obrabotri informacii, Vol.9, pp. 103-108, 1990 (in Russian).

  7. B. Shidlovsky, Validation method in distributed databases, Proc. All-Union Conference on Database Systems, Kalinin, Russia, 1990, pp.89-93 (in Russian).

  8. B. Shidlovsky, Mathematical square problem in multitransputer systems, Proc. All-Union Conf. Transputers and Applications, Moscow, Russia,Vol.2, pp.49-54, 1991 (in Russian).

  9. B. Shidlovsky, Concurrent B-tree : double validation method, Proc. Ukrainian Conf. Comp. Software and Application, 1992 ,pp. 110-118 (in English).

  10. B. Shidlovsky, S.Seredjuck, Concurrent balancing on trie hashing, Intern. Conf. Applications in Comp. Science, Lviv, Ukraine, 1992, pp. 33-39 (in English).

  11. B. Shidlovsky, Concurrent data structures in database system systems, Sistemy Programmirovanija, 1994, N. 4, pp.79-88 (in Russian).

  12. B. Shidlovsky, S. Salerno, On the advanced optimistic algorithms for concurrent B-tree, Basque International Workshop on Information Technology, BIWIT'95, June 1995, IEEE Computer Press, San-Sebastian, Spain, pp.152-161.

  13. E. Bertino, S. Salerno, B.Shidlovsky, Enhanced nested-inherited index for OODBMS, 4th International ACM Conference on Information and Knowledge Management (CIKM), Baltimore, MA, November 1995, pp.58-65.

  14. B.Shidlovsky, E. Bertino, A graph-theoretic approach to indexing in object-oriented databases, Intern. 12th IEEE Conf. on Data Engineering (ICDE), IEEE Computer Society Press, New Orleans, Louisiana, February 1996, pp.230-237.

  15. B.Shidlovsky, E. Bertino, A mathematical model of optimal indexing in object-oriented databases, Object-Oriented Database System Symposium, Montpellier, France, July 1996.

  16. B.Shidlovsky, E. Bertino, On the Number of Descendants in an Object DAG, Information Processing Letters, 1996, Vol.58 (5), 211-216.

  17. E. Bertino, B. Catania and B. Shidlovsky, Towards Optimal Two-Dimensional Indexing for Constraint Databases , Information Processing Letters, 1997, Vol. 64 (1), pp. 1-8.

  18. B. Chidlovskii, U. Borghoff and P.-Y. Chevalier, Toward Sophisticated Wrapping of Web-based Information Repositories, Proc. 5th RIAO Conference, Montreal, Canada, pp. 123-135, June 1997.

  19. J.-M. Andreoli, U. Borghoff, P.-Y. Chevalier, B. Chidlovskii, R. Pareschi and J. Willamowski, The Constraint-Based Knowledge Broker System , Proc. 13th Intern. Conf. Data Engineering, IEEE Computer Society Press, April 1997, Birmingham UK.

Back