Sciweavers

353 search results - page 18 / 71
» Processing Top-k Join Queries
Sort
View
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 1 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
14 years 9 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
SIGMOD
2011
ACM
248views Database» more  SIGMOD 2011»
12 years 10 months ago
Llama: leveraging columnar storage for scalable join processing in the MapReduce framework
To achieve high reliability and scalability, most large-scale data warehouse systems have adopted the cluster-based architecture. In this paper, we propose the design of a new clu...
Yuting Lin, Divyakant Agrawal, Chun Chen, Beng Chi...
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 8 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
WWW
2005
ACM
14 years 8 months ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling