Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

ICDE
2002
IEEE

favoriteEmaildiscussreport

217views Database» more ICDE 2002»

Evaluating Top-k Queries over Web-Accessible Databases

14 years 5 months ago

Evaluating Top-k Queries over Web-Accessible Databases

Download www1.cs.columbia.edu

Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org. C 2004 ACM 0362-5915/04/0600-0319 $5.00 ACM Transactions on Database Systems, Vol. 29, No. 2, June 2004, Pages 319?362.

Nicolas Bruno, Luis Gravano, Amélie Marian

Real-time Traffic

ACM Transactions | Database | ICDE 2002 | Ny 10036 Usa |

claim paper

Related Content

» A graph method for keywordbased selection of the topK databases

» Mining TopK Multidimensional Gradients

» Optimizing Multiple TopK Queries over Joins

» TopK aggregation queries over large networks

» SumMax Monotonic Ranked Joins for Evaluating TopK Twig Queries on Weighted Data Graphs

» Adaptive Processing of TopK Queries in XML

» Optimal TopK Query Evaluation for Weighted Business Processes

» Supporting TopK Keyword Search in XML Databases

» Dominant Graph An Efficient Indexing Structure to Answer TopK Queries

Post Info
More Details (n/a)

Added	01 Nov 2009
Updated	01 Nov 2009
Type	Conference
Year	2002
Where	ICDE
Authors	Nicolas Bruno, Luis Gravano, Amélie Marian

Comments (0)