Sciweavers

2850 search results - page 152 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 8 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ICDE
2008
IEEE
188views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Aggregate Computation over Data Streams
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...
Kanthi Nagaraj, K. V. M. Naidu, Rajeev Rastogi, Sc...
223
Voted
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 3 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
SSD
1999
Springer
158views Database» more  SSD 1999»
15 years 7 months ago
Capturing the Uncertainty of Moving-Object Representations
Spatiotemporal applications, such as fleet management and air traffic control, involving continuously moving objects are increasingly at the focus of research efforts. The repres...
Dieter Pfoser, Christian S. Jensen
SIGMOD
2004
ACM
204views Database» more  SIGMOD 2004»
16 years 3 months ago
Buffering Database Operations for Enhanced Instruction Cache Performance
As more and more query processing work can be done in main memory, memory access is becoming a significant cost component of database operations. Recent database research has show...
Jingren Zhou, Kenneth A. Ross