Data processing: database and file management or data structures – Database design – Database and data structure management
Reexamination Certificate
2004-07-30
2010-12-07
Jalil, Neveen Abel (Department: 2165)
Data processing: database and file management or data structures
Database design
Database and data structure management
Reexamination Certificate
active
07849109
ABSTRACT:
A query processor's capabilities may be employed to identify a range rows resulting from a user query to be returned. A server cursor may be declared, opened, fetched from and closed in a single batched request in order to avoid keeping state on a database server between requests. A single block fetch may be used within the batch to retrieve a requisite number of rows from a specified ordinal position. Where server cursors are not available, an intermediate table may be used to hold a subset of the rows resulting from the user query, and row numbers may be added to facilitate selecting the range of rows from that intermediate table. Intelligence within a query processor may be leveraged to support identifying the range of rows to be returned without maintaining state between client requests.
REFERENCES:
patent: 6460027 (2002-10-01), Cochrane et al.
patent: 6460071 (2002-10-01), Hoffman
patent: 6539396 (2003-03-01), Bowman-Amuah
patent: 6640244 (2003-10-01), Bowman-Amuah
patent: 6748448 (2004-06-01), Barrera et al.
patent: 2002/0111949 (2002-08-01), Barga et al.
patent: 2002/0143728 (2002-10-01), Cotner et al.
patent: 2005/0021505 (2005-01-01), Bernal et al.
patent: 2005/0021514 (2005-01-01), Barga et al.
patent: 2005/0228823 (2005-10-01), Cotner et al.
Freeze, Wayne S., “Data Paging,” Sep. 1, 2003, http://devcenter.infragistics.com/Articles/PrintArticle.aspx?ArticlelD=1230, pp. 1-7.
Meier, J.D., et al., “Chapter 4: Architecture and Design Review of a .NET Application for Performance and Scalability,” May 2004,Microsoft, pp. 1-26.
Freeze, Wayne, “Data Paging,” Sep. 1, 2003, ASP.NETPro, pp. 1-5.
Agrawal R. et al., “Reducing Page Thrashing in Recursive Query Processing”, Foundations of Data Organization and Algorithms. 4thInternational Conference,FODO, 1993, 247-263.
Bouganim, L. et al., “Memory-Adaptive Scheduling for Large Query Execution”,Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998, 105-115.
Feuerstein, E. et al., “Paging more than One Page”,Journal of Graph Algorithms and Applications, 1998, 2, 273-285.
Feuerstein, E. et al., “Memory Paging for Connectivity and Path Problems in Graphs”,Journal of Graph Algorithms and Applications, 1998, 2(6), 1-22, http://www.cs.brown.edu/publications/jgaa.
Rose, C. et al., “Paging Cost Minimization Under Delay Constraints”,IEEE INFOCOM, The Conference on Computer Communications, 14thAnnual Joint Conference of the IEEE Computer and Communication Societies, 1995, 2, 490-495.
Divringi Lale R.
Pizzo Michael J.
Abel Jalil Neveen
Microsoft Corporation
Syed Farhan M
Woodcock & Washburn LLP
LandOfFree
Use of server processing of temporary results for stateless... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Use of server processing of temporary results for stateless..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Use of server processing of temporary results for stateless... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4203752