C. C. Chang, R. C. T. Lee, and M. W. Du. "Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries". "IEEE Transactions on Software Engineering", 8(3):234--248, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Predicate-based Cache Management for Continuous Partial Match .. - Yon Dohn Chung (Correct)
....is also energy and bandwidth efficient. In this paper, we consider continuous partial match queries. A continuous partial match query is a continuous query whose type is a partial match query. A partial match query is a query which retrieves data records by specifying some non key attributes [10, 12, 5, 7]. For example, consider table R for stock price information which consists of four attributes: company ID , amount of sale , amount of purchase and current price . The following query is a typical partial match query. It searches stock records whose current price values are less than 30 ....
....is known to be better for CIR broadcasting. In this paper, we use the TS method as the basic CIR structure. 2. 2 Continuous Partial Match Queries The partial match query, which retrieves data records by specifying some non key attributes, has many applications in mobile and (or) fixed systems [10, 12, 5, 7]. Suppose there is a wireless stock price information system, where mobile clients submit queries for stock price information to the server. A mobile client may submit an exact match query e.g. a query that retrieves the stock information of a specified company. But, in many cases, queries on the ....
[Article contains additional citation context not shown here]
C. C. Chang, R. C. T. Lee, and M. W. Du. "Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries". "IEEE Transactions on Software Engineering", 8(3):234--248, 1982.
A Gray Code for Necklaces of Fixed Density - Wang, Savage (1997) (4 citations) (Correct)
....the binary reflected Gray code [Gra] which is a list of all n bit binary strings in which each string differs from its successor in exactly one bit. By applying the binary Gray code, a variety of problems have been solved and the complexities of the solutions to other problems have been improved [Gar, ChLeDu, ChChCh, Los, Ric]. There are many examples of combinatorial families for which Gray codes are known, including permutations [Joh, Tro] combinations [BuWi, NiWi, Rus1] compositions [Kli] set partitions [Kay] integer partitions [Sav, RaSaWe] binary trees [RuPr, Luc, LuRoRu] and linear extensions [PrRu1, PrRu2, ....
C. C. Chang, R. C. T. Lee, and M. W. Du, "Symbolic Gray code as a perfect multiattribute hashing scheme for partial match queries," IEEE Transactions on Software Engineering SE - 8, 3 (May 1982) 235-249.
Effective Clustering of Records for Fast Query Processing - Ramamohanarao, Harris (1996) (1 citation) (Correct)
....a good heuristic, we have preliminary evidence which indicates that it is not optimal, in general. This is an area of continuing research. Other optimisations which can be used, in addition to those we have discussed in previous sections, are the use of Gray codes to interpret the choice vectors [3, 6] and the reading of unnecessary pages to improve performance [25] The idea behind the use of Gray codes is to take the output of using the choice vector, the list of disk page addresses, and apply the Gray code transformation to them. This produces a localised form of page clustering ....
C. C. Chang, R. C. T. Lee, and M. W. Du. Symbolic Gray code as a perfect multiattribute hashing scheme for partial match queries. IEEE Transactions on Software Engineering, 8(3):235--249, May 1982.
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