Z. Lin and C. Faloutsos, Frame-sliced signature files, IEEE Transactions on Knowledge and Data Engineering 4, (3) (1992) 281-289.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....operations without enumeration. To accommodate mixed granularities in TSQL2 (the temporal extension to SQL) Dyreson et al. proposed to organize multiple granularities into a lattice and support the query language using two operations, scale and cast [Sno95] This approach was further re ned in [DELS00,Lin97] Speci cally, the user speci es granularities by providing conversion functions (scale and cast) between some pairs of granularities. Two types of mappings were distinguished: regular mapping, which has well de ned formula, and irregular mapping, which is speci ed by user supplied ....

C.E. Dyreson, W.S. Evans, H. Lin, and R.T. Snodgrass. Eciently supporting temporal granularities. IEEE Transactions on Knowledge and Data Engineering, 12(4):568-587, 2000.

....generated for individual query terms using hash functions [1] These signatures are then combined to form object signatures either by concatenating or by bitwise OR ing the signatures. The former method is known as concatenation coding (CC) while the latter is known as superimposed coding (SC) [2]. 3 Indexing a Block Compressed Database In this section we present our proposed approach for indexing block compressed data, where signature files are utilized to index the compressed data. 3.1 Overview of the Proposed Approach Consider a table T having m attributes where attribute A 1 ....

Z. Lin and C. Faloutsos. Frame-sliced signature files. IEEE Transactions on Knowledge and Data Engineering, 4(3):281--289, June 1992.

No context found.

Z. Lin and C. Faloutsos, Frame-sliced signature files, IEEE Transactions on Knowledge and Data Engineering 4, (3) (1992) 281-289.

....files provide a space efficient fast search structure by searching the signatures, instead of searching the actual records. A record signature is a bit string reflecting the essence of the record attributes. Insertions and updates in signature files require less time compared to inverted files [4]. Several signature file organization methods have been proposed to obtain better space utilization or retrieval speed performance or both [1] Storing a signature file in columnwise order is called bit sliced storage and query evaluation [5] The bit sliced query To whom all correspondence ....

....sized vertical fragments and the optimality condition is relaxed by increasing the number of zeros in record signatures. To satisfy the optimality condition half of the bits in the record signature must be 1 [2] The proposed method is different from the frame sliced signature file method [4]. In frame sliced signature file, the signature is divided into equal sized frames and the onbits of a term are directed to one or more frames. In the proposed method, the size of the fragments and the number of bits set by each term in each fragment may be different. More importantly, our ....

[Article contains additional citation context not shown here]

Z. Lin and C. Faloutsos, Frame-sliced signature files, IEEE Transactions on Knowledge and Data Engineering 4, (3) (1992) 281-289.

....intuitive ontology based grammar for annotation, which comprehensively captures the semantics related to space and time. We show how to represent the spatio temporal semantics related to, e.g. event and state [32] valid time and transaction time [76] existence time [32] temporal granularities [5, 6, 14], valid time indeterminacy [15] shape and position [13] spatial resolution and imprecision [86, 87] and change in position and or shape over time [58, 82] we have described the semantics related to granularities and indeterminacy in detail elsewhere [35] With our approach, we have integrated ....

....[2] predicates: before, before 1 , meets, meets 1 , overlaps, overlaps 1 , finished, finished 1 , during, during 1 , starts, starts 1 and equals. Temporal granularity is an integral part of temporal data and is defined as a mapping TG from index i to subsets of the time domain [14]. Thus, temporal granularity defines a countable set of non decomposable granules TG(i) that can be composed of a set of contiguous instants or non contiguous instants; additionally, a special granule called the origin, TG(0) is non empty. Some examples of temporal granularities are Gregorian day, ....

[Article contains additional citation context not shown here]

C. E. Dyreson, W. S. Evans, H. Lin and R. T. Snodgrass, EfficientlySupporting Temporal Granularities, IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 4, pp. 568-587, 2000.

....with different signature widths (column sizes) Depending on its size each sub signature file is stored in either the bit sliced (column size = 1) or frame sliced (column size 1) format. The other vertical partitioning approaches, namely bit sliced (BSSF) 7] generalized frame sliced (GFSSF) [6], and multi fragment (MFSF) 5] signature file methods are special cases GMFSF. A prototype information retrieval (IR) system is implemented based on the proposed method GMFSF. The performance of GMFSF is measured analytically and experimentally. Also, a comparison with the inverted files in terms ....

....of a slice is N bits. 2. 2 Generalized Frame Sliced Signature Files: GFSSF(D, F, m, k, n) In GFSSF a signature is divided into k equal sized s bits wide frames (s = F k) Each term first randomly selects n frames, then randomly sets m bits (not necessarily distinct) in each of the selected frames [6]. In this method, the size of a frame is s N bits and each frame is stored separately as a sequential signature file. For k = F, the frames become bit slices of BSSF. A bit sliced signature file BSSF(D,F,m) is a special case of GFSSF with the parameters (D,F,1,F,m) 6] GFSSF provides ....

[Article contains additional citation context not shown here]

Z. Lin and C. Faloutsos, Frame-sliced signature files, IEEE Transactions on Knowledge and Data Engineering 4, (3) (1992) 281-289.

....files provide a space efficient fast search structure by searching the signatures, instead of searching the actual records. A record signature is a bit string reflecting the essence of the record attributes. Insertions and updates in signature files require less time compared to inverted files [4]. Several signature file organization methods have been proposed to obtain better space utilization or retrieval speed performance or both [1] Storing a signature file in columnwise order is called bit sliced storage and query evaluation [5] The bit sliced query To whom all correspondence ....

....variable sized vertical fragments and the optimality condition is relaxed by increasing the number of zeros in record signatures. To satisfy the optimality condition half of the bits in the record signature must be 1 [2] The proposed method is different from the frame sliced signature file method [4]. In frame sliced signature file, the signature is divided into equal sized frames and the onbits of a term are directed to one or more frames. In the proposed method, the size of the fragments and the number of bits set by each term in each fragment may be different. More importantly, our ....

[Article contains additional citation context not shown here]

Z. Lin and C. Faloutsos, Frame-sliced signature files, IEEE Transactions on Knowledge and Data Engineering 4, (3) (1992) 281-289.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC