Data structures for efficient broker implementation

ACM Transactions on Information Systems

Volumn 15, Issue 3, 1997, Pages 223-253

  Tomasic, Anthony ^a,d   Gravano, Luis ^b,e   Lue, Calvin ^c,f   Schwarz, Peter ^c   Haas, Laura ^c  

^a INRIA   (France)

^b STANFORD UNIVERSITY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d INRIA ROCQUENCOURT   (France)

^e Stanford University   (United States)

^f TRIDENT SYSTEMS INC   (United States)

Author keywords

H.2.2 Database Management : Physical design access methods; H.3.1 Information Storage and Retrieval : Content Analysis and Indexing indexing methods; H.3.3 Information Storage and Retrieval : Information Search and Retrieval search process

Indexed keywords

DATA STORAGE EQUIPMENT; DATA STRUCTURES; INFORMATION RETRIEVAL; QUERY LANGUAGES; USER INTERFACES;

GRID FILES; INTERNET; PARTITIONED HASHING; TEXT DATABASES;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0031177232     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/256163.256165     Document Type: Article

References (47)

1. AHO, A. V. AND ULLMAN, J. D. 1979. Optimal partial-match retrieval when fields are independently specified. ACM Trans. Database Syst. 4, 2 (June), 168-179.
2. BARBARA, D. AND CLIFTON, C. 1992. Information brokers: Sharing knowledge in a heterogeneous distributed system. Tech. Rep. MITL-TR-31-92, Matsushita Information Technology Laboratory, Princeton, N.J. October.
3. BECKER, L., HINRICHS, K., AND FINKE, U. 1993. A new algorthm for computing joins with grid files. In Proceedings of the 9th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, Calif., 190-197.
4. BERNERS-LEE, T., CAILLIAU, R., GROFF, J.-F., AND POLLERMANN, B. 1992. World-Wide Web: The information universe. Elect. Network. Res. Appl. Policy 1, 2.
5. BOWMAN, C. M., DANZIG, P. B., HARDY, D. R., MANBER, U., AND SCHWARTZ, M. F. 1994. Harvest: A scalable, customizable discovery and access system. Tech. Rep. CU-CS-732-94, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo.
6. BROWN, E. W., CALLAHAN, J. P., AND CROFT, W. B. 1994. Fast incremental indexing for full-text information retrieval. In Proceedings of the 20th International Conference on Very Large Data Bases. VLDB Endowment, Saratoga, Calif., 192-202.
7. CALLAN, J. P., LU, Z., AND CROFT, W. B. 1995. Searching distributed collections with inference networks. In Proceedings of the 18th Annual SIGIR Conference. ACM, New York.
8. CUTTING, D. AND PEDERSEN, J. 1990. Optimizations for dynamic inverted index maintenance. In Proceedings of the 13th International Conference on Research and Development in Information Retrieval. ACM, New York, 405-411.
9. DANZIG, P. B., AHN, J., NOLL, J., AND OBRACZKA, K. 1991. Distributed indexing: A scalable mechanism for distributed information retrieval. In Proceedings of the 14th Annual SIGIR Conference. ACM, New York.
10. DANZIG, P. B., LI, S.-H., AND OBRACZKA, K. 1992. Distributed indexing of autonomous Internet services. Comput. Sys. 5, 4.
11. DUDA, A. AND SHELDON, M. A. 1994. Content routing in a network of WAIS servers. In the 14th IEEE International Conference on Distributed Computing Systems. IEEE, New York.
12. FALOUTSOS, C. 1986. Multiattribute hashing using Gray codes. In Proceedings of the 1986 ACM SIGMOD Conference. ACM, New York, 227-238.
13. FLATER, D. W. AND YESHA, Y. 1993. An information retrieval system for network resources. In Proceedings of the International Workshop on Next Generation Information Technologies and Systems.
14. FREESTON, M. 1995. A general solution of the n-dimensional b-tree problem. In Proceedings of the 1995 ACM SIGMOD Conference. ACM, New York, 80-91.
15. GRAVANO, L. AND GARCIA-MOLINA, H. 1995. Generalizing GlOSS for vector-space databases and broker hierarchies. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB'95). VLDB Endowment, Saratoga, Calif., 78-89.
16. GRAVANO, L., GARCIA-MOLINA, H., AND TOMASIC, A. 1994a. The effectiveness of GlOSS for the text-database discovery problem. In Proceedings of the 1994 ACM SIGMOD Conference. ACM, New York. Also available as ftp://db.stanford.edu/pub/gravano/1994/ stan.cs.tn.93.002.sigmod94.ps.
17. GRAVANO, L., GARCIA-MOLINA, H., AND TOMASIC, A. 1994b. Precision and recall of GlOSS estimators for database discovery. In Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems (PDIS'94). IEEE Computer Society Press, Los Alamitos, Calif. Also available as ftp://db.stanford.edu/pub/gravano/1994/stan.cs.tn.94.101. pdis94.ps.
18. GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD Conference. ACM, New York, 47-57.
19. HARMAN, D. K., Ed. 1995a. Overview of the 3rd Text Retrieval Conference (TREC-3). NIST Special Pub. 500-225, Coden: NSPUE2. U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology (NIST), Gaithersburg, Md.
20. HARMAN, D., Ed. 1995b. Proceedings of the 3rd Text Retrieval Conference (TREC-3). National Institute of Standards and Technology, Gaithersburg, Md. Available as Special Pub. 500-225.
21. HARMAN, D., E. 1996. Proceedings of the 4th Text Retrieval Conference (TREC-4). National Institute of Standards and Technology, Gaithersburg, Md.
22. HINRICHS, K. 1985. Implementation of the grid file: Design concepts and experience. BIT 25, 569-592.
23. KAHLE, B. AND MEDLAR, A. 1991. An information system for corporate users: Wide Area Information Servers. Tech. Rep. TMC199, Thinking Machines Corp., Boston, Mass.
24. KNUTH, D. E. 1973. The Art of Computer Programming. Vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass.
25. LLOYD, J. W. 1980. Optimal partial-match retrieval. BIT 20, 406-413.
26. LLOYD, J. W. AND RAMAMOHANARAO, K. 1982. Partial-match retrieval for dynamic files. BIT 22, 150-168.
27. NEUMAN, B. C. 1992. The Prospero file system: A global file system based on the Virtual System model. Comput. Syst. 5, 4.
28. NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K. C. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, 1 (Mar.), 38-71.
29. OBRACZKA, K., DANZIG, P. B., AND LI, S.-H. 1993. Internet resource discovery services. IEEE Comput. 26, 9 (Sept.).
30. ORDILLE, J. J. AND MILLER, B. P. 1992. Distributed active catalogs and meta-data caching in descriptive name services. Tech. Rep. 1118, Univ. of Wisconsin, Madison, Wisc.
31. ORENSTEIN, J. A. AND MERRETT, T. H. 1984. A class of data structures for associative searching. In the 3rd ACM Symposium on Principles of Database Systems. ACM, New York, 181-190.
32. PISSANETZKY, S. 1984. Sparse Matrix Technology. Academic Press, New York.
33. SALTON, G. AND MCGILL, M. J. 1983. Introduction to Modern Information Retrieval. McGraw-Hill, New York.
34. SCHWARTZ, M. F. 1990. A scalable, non-hierarchical resource discovery mechanism based on probabilistic protocols. Tech. Rep. Cu-CS-474-90, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo.
35. SCHWARTZ, M. F., EMTAGE, A., KAHLE, B., AND NEUMAN, C. B. 1992. A comparison of Internet resource discovery approaches. Comput. Syst. 5, 4.
36. SELLIS, T., ROUSSOPOULOS, N., AND FALOUTSOS, C. 1987. The R+-tree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th Conference on Very large Databases. VLDB Endowment, Saratoga, Calif., 507-518.
37. SHELDON, M. A., DUDA, A., WEISS, R., O'TOOLE, J. W., AND GIFFORD, D. K. 1994. A content routing system for distributed information servers. In Proceedings of the 4th International Conference on Extending Database Technology. Springer-Verlag, Berlin.
38. SIMPSON, P. AND ALONSO, R. 1989. Querying a network of autonomous databases. Tech. Rep. CS-TR-202-89, Dept. of Computer Science, Princeton Univ., Princeton, N.J.
39. TOMASIC, A. AND GARCIA-MOLINA, H. 1996. Performance issues in distributed shared-nothing information retrieval systems. Inf. Process. Manage. 32, 6.
40. TOMASIC, A., GARCIA-MOLINA, H., AND SHOENS, K. 1994. Incremental updates of inverted lists for text document retrieval. In Proceedings of the 1994 ACM SIGMOD Conference. ACM, New York, 289-300.
41. TOMASIC, A., GRAVANO, L., LUE, C., SCHWARZ, P., AND HAAS, L. 1995. Data structures for efficient broker implementation. Tech. Rep., IBM Almaden Research Center, San Jose, Calif. Also available as ftp://db.stanford.edu/pub/gravano/1995/ibm_rj.ps.
42. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems. Vol. 1. Computer Science Press, Boca Raton, Fla.
43. VOORHEES, E. M. 1996. Siemens TREC-4 report: Further experiments with database merging. In Proceedings of the 4th Text Retrieval Conference (TREC-4). NIST, Gaithersburg, Md.
44. VOORHEES, E. M., GUPTA, N. K., AND JOHNSON-LAIRD, B. 1995. The collection fusion problem. In Proceedings of the 3rd Text Retrieval Conference (TREC-3). NIST, Gaithersburg, Md.
45. WEIDER, C. AND FALTSTROM, P. 1994. The WHOIS++ directory service. ConneXions 8, 12 (Dec.).
46. WIEDERHOLD, G. File Organization for Database Design. McGraw-Hill, New York.
47. ZOBEL, J., MOFFAT, A., AND SACKS-DAVIS, R. 1992. An efficient indexing technique for full-text database systems. In Proceedings of the 18th International Conference on Very Large Data Bases. VLDB Endowment, Saratoga, Calif., 352-362.