Searchable archive

Details Searchable archive Searchable archive

2007-07-10

2007-07-10

Al-Hashemi, Sana (Department: 2164)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

10783643

ABSTRACT:
A searchable archiving system. A searchable archiving system includes one or more compacted files of archive data loosely coupled to a search process. To create a compacted file, an archiving process tokenizes the archive data, optimizes the tokenized archive data, and extracts archive metadata from the tokenized data. The tokenized data may then be compressed in a variety of ways into compressed segments that may be individually accessed and decompressed by the search agents. Before compression, segment metadata is extracted from the segments. The compressed segments and segment metadata are then combined to create a compacted file. The search process accesses the compacted files by consulting locally stored archive metadata extracted from the files during the compaction process. The search process then invokes one or more search agents that actively search the compacted files. The search agents do so by using the segment metadata to identify segments to decompress and search.

REFERENCES:
patent: 5574906 (1996-11-01), Morris
patent: 5835667 (1998-11-01), Wactlar et al.
patent: 2003/0001930 (2003-01-01), Nakata et al.
patent: 2003/0093434 (2003-05-01), Stickler
patent: 2005/0033733 (2005-02-01), Shadmon et al.
patent: 2005/0055372 (2005-03-01), Springer et al.
patent: 2005/0165838 (2005-07-01), Fontoura et al.
patent: 1152352 (2001-11-01), None
patent: WO 01/59613 (2001-08-01), None
Hoss,Top Ten Trends in Data Warehousing, dataWarehouse.com, Oct. 30, 2001, 5 pgs.
CORWORKS,Corworks Knowledge Server, 4 pgs. Stamford.
DATZ,Emerging Technology, Innovation and Products in the Vanguard Company to Watch Corworks: Data Diets, CIO Magazine, Jan. 1, 2003 issue, 2 pgs. Stamford.
Lindstrom,Log Management: The Foundation of Network Security; A Spire Research Report, Jan. 2003, 11 pgs., Spire Security, LLC, Malvern.
Poess et al.,Data Compression in Oracle, 29th VLDB Conference, 2003, 11 pgs., Berlin.
Baeza-Yates et al.,Block Addressing Indices for Approximate Text Retrieval, 1997, pp. 1-8 , CIKM, Las Vegas.
Navarro et al.,Adding Compression to Block Addressing Inverted Indexes, Feb. 15, 2000, pp. 1-36, Kluwer Academic, Netherlands.
Vo et al.,Compressed Inverted Files with Reduced Decoding Overheads, 1998 pp. 290-297, SIGIR, Melbourne.
Goldstein et al.,Compressing Relations and Indexes, Jun. 18, 1997, pp. 1-23, University of Wisconsin, Madison.
Cannane et al,A General-Purpose Compression Scheme for Large Collections, Jul. 2002, pp. 329-355, vol. 20, No. 3, ACM Transactions on Information Systems.
Williams et al.,Compressing Integers for Fast File Access, The Computer Journal, 1999, pp. 193-201, vol. 42, No. 3.
Buchsbaum et al.,Engineering the Compression of Massive Tables: An Experimental Approach, pp. 175-184, AT&T Labs, Florham Park.
Babu et al.,A Model-Based Semantic Compression System for Massive Data Tables, May 21-24, 2001, pp. 283-294, ACM Sigmod, Santa Barbara.
Garofalakis et al.,Data Mining Meets Network Management: The Nemesis Project, pp. 1-6, Bell Laboratories, Murray Hill.
The Daytona™, Jan. 23, 2004, pp. 1-44, http://www. research.att.com/projects/daytona . . . .
Westmann et al.,The Implementation and Performance of Compressed Databases, Germany, 13 pgs.
Scholer,Compression of Inverted Indexes For Fast Query Evaluation, Aug. 11-15, 2002, pp. 222-229, SGIR.
NG, et al.,Relational Database Compression Using Augmented Vector Quantization, 11th IEEE International Conference on Data Engineering, Mar. 6-10, 1995, pp. 1-10, Taipei.
Copeland et al.,A Decomposition Storage Model, pp. 268-279, Microelectronics And Technology Computer Corporation, 1985 Austin.
Copy of European Search Report for EP App. No. 05250356.2, transmitted Oct. 6, 2006, dated Sep. 21, 2006, 2 pgs.

Affiliated with

Also associated with

Rating

Searchable archive does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3768171