Sciweavers

154 search results - page 20 / 31
» Exploiting Similarity of Subqueries for Complex Query Optimi...
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 2 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
BMCBI
2006
120views more  BMCBI 2006»
13 years 8 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 8 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
SSD
2005
Springer
185views Database» more  SSD 2005»
14 years 1 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
14 years 3 days ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis