Sciweavers

368 search results - page 45 / 74
» Efficient exploitation of similar subexpressions for query p...
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 9 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
14 years 1 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 9 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ICDCS
2007
IEEE
14 years 27 days ago
GeoGrid: A Scalable Location Service Network
This paper presents GeoGrid, a geographical location service overlay network system, for providing scalable location-based services to a large and growing number of mobile users. ...
Jianjun Zhang, Gong Zhang, Ling Liu
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 10 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...