Distributed Processing and Time Complexity Analysis of Boolean Query Formulation Algorithms
The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 3, pp. 709-719, Mar. 1997
10.3745/KIPSTE.1997.4.3.709, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
K. N. Ho, "Distributed Processing and Time Complexity Analysis of Boolean Query Formulation Algorithms," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 3, pp. 709-719, 1997. DOI: 10.3745/KIPSTE.1997.4.3.709.
[ACM Style]
Kim Nam Ho. 1997. Distributed Processing and Time Complexity Analysis of Boolean Query Formulation Algorithms. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 3, (1997), 709-719. DOI: 10.3745/KIPSTE.1997.4.3.709.