Corpus ID: 53888761

A Bibliography of ACM SIGMOD Record

  title={A Bibliography of ACM SIGMOD Record},
  author={Nelson H. F. Beebe},
s [41, 42]. academia [1932, 1926, 2267, 2275]. academic [1908, 2441]. acceleration [1869]. Access [2370, 13, 38, 1530, 1620, 1555, 2106, 1643, 1410, 602, 1672, 1033, 531, 601, 803, 1532, 1531, 949, 2204, 1455, 657, 598, 1263, 1086, 749, 409, 1969, 319, 2119, 450, 872, 1808, 171, 1559, 238, 821, 812, 1209, 1198, 694, 126, 1357, 883, 2139]. accesses [406]. Accessing [1295, 127, 515]. Accommodating [626]. account [1889]. accounting [679]. accrued [2385]. Accurate [276, 855]. achieve [858… Expand
1 Citations
A Bibliography of Publications of Nelson H. F. Beebe
This bibliography records publications of Nelson H. F. Beebe. Title word cross-reference #1 [68]. #2 [99, 184]. #3 [100, 186]. #4 [115, 192]. #5 [117, 195]. #6 [201]. #7 [210]. #8 [223]. 10 [49]. +Expand


Structural matching and discovery in document databases
In SIGMOD 95 demo sessions, a software package, called TreeDiff, for comparing two latex documents and showing their differences is exhibited, which represents the documents as ordered labeled trees and finds an optimal sequence of edit operations to transform one document (tree) to the other. Expand
Querying object-oriented databases
This paper presents a new query language, henceforth referred to as XSQL, that incorporates novelties not found in earlier languages and is easier to use and it has more expressive power than previous languages. Expand
Introduction to constraint databases
This book presents the constraint database model as a powerful extension of the relational model that allows a user or programmer to work easily with infinite data and shows that the constraint model provides an elegant tool for data modeling and querying in application areas such as geographic information systems, spatiotemporal data management, bioinformatics, genome databases and computer vision. Expand
Automata theory for XML researchers
The advent of XML initiated a symbiosis between document research, databases and formal languages that resulted in the development of unranked tree automata, a simple but effective paradigm that found application in several formalisms. Expand
OODB indexing by class-division
This work has developed a technique, called indexing by class-division (CD), which it is believed can be used as a practical alternative to CH and an optimized implementation and experimental validation of CD's average-case performance are presented. Expand
Object-relational database systems (tutorial): principles, products and challenges
This tutorial is to explain what the key features are of object-relational database systems, review what today's products provide, and then look ahead to where these systems are heading. Expand
Research activities in database management and information retrieval at University of Illinois at Chicago
Today, millions of people employ powerful search engines such as Google to retrieve information from the Web on a daily basis. In spite of the success, there are problems associated with suchExpand
Parallel database systems 101
  • J. Gray
  • Computer Science
  • SIGMOD '95
  • 1995
These tests are simpler than the TPC D benchmrwk that tests the query optimizer and the ability to run multiple-concurrent tasks and can be applied to a parallel database system in an hour as a simple sanity check. Expand
Determining relationships among names in heterogeneous databases
An automatic mapping process, an process to recognize potential relationships among different names and a process to expand knowledge in the authors' knowledge base are described so as to facilitate the first two processes. Expand
Database theory: where has it been? where is it going?
Database theory is the application of mathematical techniques to the solution of problems related to ths design, implementation, and use of database mangement systems. It is not a tightly integratedExpand