Sciweavers

1888 search results - page 30 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
GIS
2008
ACM
14 years 11 months ago
Snapshot location-based query processing on moving objects in road networks
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
Haojun Wang, Roger Zimmermann
90
Voted
PCI
2005
Springer
15 years 3 months ago
Closest Pair Queries with Spatial Constraints
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
15 years 12 months ago
A Data Structure for Sponsored Search
Abstract-- Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (a...
Arnd Christian König, Kenneth Ward Church, Ma...
ICEC
1996
80views more  ICEC 1996»
14 years 11 months ago
A Genetic Algorithm for Structural Query Processing in Hypertext Systems
Jiunn-Chin Wang, Jorng-Tzong Horng, Kuo-Chin Fan, ...
INFOCOM
2006
IEEE
15 years 4 months ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...