| R. Agrawal and R. Srikant. Searching with numbers. Proceedings of WWW, 2002. |
....and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and or special permission from the Endowment. Proceedings of the 28th VLDB Conference, Hong Kong, China, 2002 attribute names [AS02]. The extent to which a dataset satisfies the above conjecture can be quantified; we call this value the non reflectivity of the dataset. For a simple example of a dataset with high non reflectivity, assume that the records contain only two attributes: memory and disksize . Further assume that ....
....n i # denote the number of points in D that have at least one reflection within distance r of n i . The non reflectivity of D in m dimensional space is then defined as: Non Reflectivity#m; r#= 1 jDj X x i 2D Non reflectivity over subsets of attributes is defined in a similar manner (see [AS02]) We consider nearest neighbor queries where the user is interested in retrieving the top t records containing values close to the query terms. For a given record and query, we find the set of numbers in the record that will minimize the L p distance between the record and the query. This ....
Rakesh Agrawal and Ramakrishnan Srikant. Searching with numbers. In Proc. of the Eleventh Int'l World Wide Web Conference (WWW), Honolulu, Hawaii, May 2002.
No context found.
R. Agrawal and R. Srikant. Searching with numbers. Proceedings of WWW, 2002.
No context found.
R. Agrawal and R. Srikant. Searching with numbers. In WWW, pages 420--431. ACM Press, 2002.
No context found.
R. Agrawal and R. Srikant. Searching with numbers. In WWW, pages 420--431. ACM Press, 2002.
No context found.
R. Agrawal and R. Srikant. Searching with numbers. Proceedings of WWW, 2002.
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