Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-12-12
2006-12-12
Channavajjala, Srirama (Department: 2166)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07149736
ABSTRACT:
Multiple aggregation groups, which can be multiple partitions in an aggregated data table, are formed. Each group includes multiple aggregation records; each aggregation record includes an aggregation of values contained by a different subset of multiple database records. While an aggregation group is accessed by a single program thread during an aggregation group update transaction, no other threads are allowed to access that group. The aggregation groups are combined into a single table of aggregation records. Each of the multiple database records may correspond to an instance of an organizational activity and include a field having a value indicating the corresponding instance to be in one of several process states. Each aggregation group may further include time-sorted aggregation records, each time-sorted aggregation record containing an aggregation value for instances in one of the several process states during a time period associated with the time-sorted aggregation record. Aggregation records corresponding to instances completed outside of a preselected time window are deleted.
REFERENCES:
patent: 5319780 (1994-06-01), Catino et al.
patent: 5537589 (1996-07-01), Dalal
patent: 5590319 (1996-12-01), Cohen et al.
patent: 5625815 (1997-04-01), Maier et al.
patent: 5713020 (1998-01-01), Reiter et al.
patent: 5717919 (1998-02-01), Kodavalla et al.
patent: 5781896 (1998-07-01), Dalal
patent: 5822751 (1998-10-01), Gray et al.
patent: 5905985 (1999-05-01), Malloy et al.
patent: 5926818 (1999-07-01), Malloy
patent: 5940818 (1999-08-01), Malloy et al.
patent: 5943668 (1999-08-01), Malloy et al.
patent: 5978796 (1999-11-01), Malloy et al.
patent: 6064999 (2000-05-01), Dalal
patent: 6115705 (2000-09-01), Larson
patent: 6122636 (2000-09-01), Malloy et al.
patent: 6205447 (2001-03-01), Malloy
patent: 6374263 (2002-04-01), Bunger et al.
patent: 6430565 (2002-08-01), Berger et al.
patent: 6438537 (2002-08-01), Netz et al.
patent: 6442560 (2002-08-01), Berger et al.
patent: 6496909 (2002-12-01), Schimmel
patent: 6502086 (2002-12-01), Pratt
patent: 6516322 (2003-02-01), Meredith
patent: 6542895 (2003-04-01), DeKimpe et al.
patent: 6546395 (2003-04-01), DeKimpe et al.
patent: 6594653 (2003-07-01), Colby et al.
patent: 6598079 (2003-07-01), Pal et al.
patent: 6603839 (2003-08-01), Smith, Jr. et al.
patent: 6665682 (2003-12-01), DeKimpe et al.
patent: 6728709 (2004-04-01), Plasek et al.
patent: 6895581 (2005-05-01), Chkodrov et al.
patent: 6988108 (2006-01-01), Bernhardt et al.
patent: 2001/0051907 (2001-12-01), Kumar et al.
patent: 2002/0143763 (2002-10-01), Martin et al.
patent: 2003/0004944 (2003-01-01), Harper et al.
patent: 2003/0061132 (2003-03-01), Yu et al.
patent: 2003/0115206 (2003-06-01), Gilbert
patent: 2003/0149702 (2003-08-01), Saffer et al.
patent: 2003/0204421 (2003-10-01), Houle et al.
patent: 2003/0225769 (2003-12-01), Chkodrov et al.
patent: 2004/0006574 (2004-01-01), Witkowski et al.
patent: 2004/0010500 (2004-01-01), Madduri et al.
patent: 2004/0083222 (2004-04-01), Pecherer
patent: 2004/0111410 (2004-06-01), Burgoon et al.
patent: 2004/0148420 (2004-07-01), Hinshaw et al.
patent: 2004/0243593 (2004-12-01), Stolte et al.
patent: 2004/0267818 (2004-12-01), Hartenstine
patent: 2005/0071341 (2005-03-01), Chkodrov et al.
patent: 2005/0144191 (2005-06-01), Chkodrov et al.
patent: 1164509 (2001-12-01), None
patent: WO 01/11497 (2001-02-01), None
patent: WO 02/42952 (2002-05-01), None
patent: WO 2004/031940 (2004-04-01), None
patent: WO 2004/084092 (2004-09-01), None
patent: WO2005/029275 (2005-03-01), None
patent: WO 2005/091138 (2005-09-01), None
patent: WO2005/091736 (2005-10-01), None
Lingyu Wang et al. “securing OLAP data cubes against privacy breaches”, proceedings of the 2004 IEEE symposium on security and privacy, May 2004, pp. 161-175.
Lenz,H et al. “OLAP databases and aggregation functions”, scientific and statistical database manaagement 2001, thrteenth international conference, Julay 2001, pp. 91-100.
Dimitri Theodoratos et al. “Heuristic optimization of OLAP queries in multidiemnsionally hierarichally clustered databases”, proceedings of the 4th ACM international workshop on data warehousing and OLAP, 2001, pp. 48-55.
Jim Gray et al. “data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals”, Technical report: MSR-TR-95-22. Nov. 1995, 8 pages.
Bellatreche,L et al. “OLAP query processing for partitioned data warehouses”, proceedings 1999 internatinal symposium on database applications in non-traditional environments, 1999, pp. 35-42.
Kline,N et al. “computing temporal aggregates”, eleventh international conference on data engineering, 1995, pp. 222-231.
Stefano Ceri et al., “Deriving Production Rules for Incremental View Maintenance,”Proc. Of 1991 VLDB Conference, pp. 577-589, 1991.
D. Gavalas et al., “Enabling Mobile Agent Technology for Intelligent Bulk Management Data Filtering,”IEEE, 2000 pp. 623-636, 2000.
D.L. Giles, “Usage Measurement in Support of Billing for Connectionless Data Services,”Bell Communications Research, Inc., 17.4-1-174-10, 1990.
G.M.E. Lafue, “Integrating language and database for CAD applications,”Computer Aided Design, vol. 11, No. 3, pp. 127-130, May 1979.
James F. Leary et al., “Real-Time Decision-Making for High-Throughput-Screening Applications,” Optical Diagnostics of Living Cells IV.Proceedings of SPIEvol. 4260 pp. 219-225 (2001).
Wolfgang Lehner, “Improving Query Response Time in Scientific Databases Using Data Aggregation—A Case Study,”Proc. Of 7thInt'l Workshop on Database and Expert Systems Applns., IEEE, pp. 201-206 (1996).
Shira Levine, “In the Black,”America's Network, p. 18, May 15, 2002.
David B. Lomet, “Subsystems of Processes with Deadlock Avoidance,”IEEE Transactions on Software Engineering, vol. SE-6, No. 3, May 1980.
Mukesh Muhania, “Making aggregate views self-maintainable,”Data&Knowledge Engineering, 32, pp. 87-109, 2000.
Kevin Reardon, “The Role of Data Archives in Synoptic Solar Physics,”Synoptic Solar Physics Conference, ASP Conference Series, vol. 140, pp. 467-474, 1998.
Cyrus Shahabi et al., “An Adaptive Recommendation System without Explicit Acquisition of User Relevance Feedback,”Distributed and Parallel Databases, 14, 173-192 (2003).
Abraham Silberschatz et al., “A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs,”IEEE Transactions on Software Engineering, vol. SE-8, No. 6, pp. 558-562, Nov. 1982.
BookInside Microsoft® SQL Server 2000by Kalen Delaney, 2001, 1090 pages.
Chkodrov Gueorgui Bonov
Jason Richard Zachary
Reel Eric Anthony
Yu Chun
Banner & Witcoff , Ltd.
Channavajjala Srirama
LandOfFree
Maintaining time-sorted aggregation records representing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Maintaining time-sorted aggregation records representing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maintaining time-sorted aggregation records representing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3663289