Sciweavers

3891 search results - page 90 / 779
» Query Models
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 7 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
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 7 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
ICDCS
1996
IEEE
15 years 6 months ago
Scaling Heterogeneous Databases and the Design of Disco
Access to large numbers of data sources introduces new problems for users of heterogeneous distributed databases. End users and application programmers must deal with unavailable ...
Anthony Tomasic, Louiqa Raschid, Patrick Valduriez
ICDE
2011
IEEE
243views Database» more  ICDE 2011»
14 years 6 months ago
Interactive SQL query suggestion: Making databases user-friendly
— SQL is a classical and powerful tool for querying relational databases. However, it is rather hard for inexperienced users to pose SQL queries, as they are required to be proï¬...
Ju Fan, Guoliang Li, Lizhu Zhou
ISORC
2006
IEEE
15 years 8 months ago
RTSTREAM: Real-Time Query Processing for Data Streams
Many real-time applications, such as traffic control systems, surveillance systems and health monitoring systems, need to operate on continuous unbounded streams of data. These ap...
Yuan Wei, Sang Hyuk Son, John A. Stankovic