Sciweavers

835 search results - page 146 / 167
» Querying time-series streams
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
15 years 11 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
SSDBM
2006
IEEE
111views Database» more  SSDBM 2006»
15 years 4 months ago
Efficient Data Harvesting for Tracing Phenomena in Sensor Networks
Many publisWsubscribe systems have been built using wireless sensor networks, WSNs, deployedfor real-world environmentaldata collection, securitymonitoring,and object tracking. Ho...
Adesola Omotayo, Moustafa A. Hammad, Ken Barker
DAGSTUHL
2007
14 years 11 months ago
Calculus and Algebra for Distributed Data Management
Abstract. The sharing of content by communities of users (e.g., scientists) in a P2P context remains cumbersome. We argue that main reasons for this is the lack of calculus and alg...
Serge Abiteboul
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan