Sciweavers

9842 search results - page 1551 / 1969
» Problem complexity
Sort
View
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 7 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
SIGMOD
2006
ACM
150views Database» more  SIGMOD 2006»
16 years 7 months ago
On-the-fly sharing for streamed aggregation
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
Sailesh Krishnamurthy, Chung Wu, Michael J. Frankl...
SIGMOD
2004
ACM
120views Database» more  SIGMOD 2004»
16 years 7 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...
SIGMOD
2003
ACM
240views Database» more  SIGMOD 2003»
16 years 7 months ago
XRANK: Ranked Keyword Search over XML Documents
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmug...
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
16 years 7 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
« Prev « First page 1551 / 1969 Last » Next »