Reduction and optiminization of operational query...

Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data streaming

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

06996625

ABSTRACT:
Techniques for arranging operations performable on information in an information processing system are provided. In a system having a plurality of information producers and a plurality of information subscribers, paths are identified over which information traverses, and within which the information is subject to select and/or transform operations. The present invention optimizes the system by reorganizing the sequence of select and transform operations so that transforms follow select operations; and by combining multiple select and transform operations into single select and transform operations, respectively. Using these optimizations, the processing resources of the system can be reorganized, and/or information flow graphs describing the system can be designed, so that the select operations are “pushed” toward the producers, and transform operations are “pushed” toward the subscribers. Efficient content-based routing systems can then be used to implement the select operations.

REFERENCES:
patent: 5175843 (1992-12-01), Casavant et al.
patent: 5367675 (1994-11-01), Cheng et al.
patent: 5412804 (1995-05-01), Krishna
patent: 5504885 (1996-04-01), Alashqur
patent: 5511186 (1996-04-01), Carhart et al.
patent: 5659725 (1997-08-01), Levy et al.
patent: 5701456 (1997-12-01), Jacopi et al.
patent: 5848408 (1998-12-01), Jakobsson et al.
patent: 5857097 (1999-01-01), Henzinger et al.
patent: 6032144 (2000-02-01), Srivastava et al.
patent: 6061676 (2000-05-01), Srivastava et al.
patent: 6370524 (2002-04-01), Witkowski
patent: 2002/0032675 (2002-03-01), Williamowski et al.
patent: 2002/0083049 (2002-06-01), Forster et al.
Interchanging group-by and join in distributed query processing, Weipeng P. Y., IBM Centre for Advanced Studies Conf., 1993, p 823-831.
Query Optimization in Database Systems, Jarke, M. & Koch, J., ACM Computing Surveys, vol. 16, ISSN: 0360-0300, Jun. 1984, p. 111-152.
Optimization of nested SQL queries revisited, Ganski & Wong, Inter. Conf. on Management of Data, ACM SIGMOD 1987, ISSN: 0163-5808, p. 23-33.
Grammar-like functional rules for representing query optimization alternatives, Lohman, G.M., Inter. Conf. on Management of Data, ACM SIGMOD 1988, ISSN: 0-89791-268-3, p. 18-27.
Access Path Selection in a Relational Database Management System, Selinger, et al. IBM Research Div., ACM 0-89791-001-X/79/0500-023, p. 23-34.
On Optimizing an SQL-like Nested Query, Kim, W., IBM Research, ACM Transaction on Database Systems, Sep. 1982, ACM 0362-5915/82/0900-0443, p. 443-469.
Optimizing Queries over Multimedia Repositorie, Chaudhuri & Gravano, ACM SIGMOD '96, Jun. 1996, ACM 0-89791-791-4/96/0006, p. 91-102.
Cost-Based Optimization for Magic: Algebra and Implementation, Seshadri et al., p. 435-446.
Rule-Based Query Optimization in IRIS, Derrett & Shan, Hewlett-Packard Lab., ACM 0-89791-299-3/89/0002/0078, p. 78-86.
Common Expression Analysis in Database Applications, Finkelstein, S., 1982, ACM 0-89791-073-7/82/006/0235, p. 235-245.
Equivalences Among Relational Expressions with the Union and Difference Operators, Sagiv & Yannakakis, Journal of the Assoc. for Computing Machinery, vol. 27, No. 4, Oct. 1980, ACM 0004-5411/80/1000-0633 00 75, p. 633-655.
A Rule-Based View of Query Optimization, Freytag, IBM Almaden Research Center,1987, ACM 0-89791-236-5/87/0005/0173, p. 173-180.
A Predicate Matching Algorithm for Database Rule Systems, Hanson et al., USAF Wright R & D Center, 1990, ACM 089791-365 5/90/0005/0271, p. 271-280.
A Parallel Pipelined Relational Query Processor, Kim, W., IBM Research, Gajski & Kuck, Univ. of Illinoin, 1984, ACM Transactions on Database Systems, vol. 9, No. 2, Jun. 1984, ACM 0362-5915/84/0600-0214, p. 214-242.
Sturman, et al., “Reflection in the Gryphon Message Brokering System,” In Reflection Workshop of 13thACM Conference on Object Oriented Programming Systems, Languages and Applications, Oct. 1998 (12 pages).
Shrufi, et al., “Query processing for knowledge bases using join indices,” Conference on Information and Knowledge Management, 4thInternational Conference on Information and Knowledge Management, ISBN: 0-89791-812-6, 1995, pp. 158-166.
Zivojnovic, et al., “High performance DSP software using data-flow graph transformations,” Signals, Systems and Computers, 1994, 28thAsilomar Conference, pp. 492-496.
Frieder, et al., “Site and query scheduling policies in multicomputer database systems,” Knowledge and Data Engineering, IEEE Transactions, vol. 6 Issue 4, Aug. 1994, ISSN: 1041-4347, pp. 609-619.
Breslow, et al., “A data-flow graphical user interface for querying a scientific database,” Visual Languages, 1993, Proceedings 1993 IEEE Symposium, Aug. 1993, ISBN: 0-8186-3970-9, pp. 49-54.
Goldberg, et al., “Combinatorial algorithms for the generalized circulation problem,” Foundations of Computer Science, 1988, 29thAnnual Symposium, Oct. 1988, pp. 432-443.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Reduction and optiminization of operational query... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reduction and optiminization of operational query..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduction and optiminization of operational query... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3712198

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.