Sciweavers

365 search results - page 26 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
ER
2010
Springer
164views Database» more  ER 2010»
14 years 7 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
SIGMOD
2006
ACM
426views Database» more  SIGMOD 2006»
15 years 9 months ago
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
Fang Liu, Clement T. Yu, Weiyi Meng, Abdur Chowdhu...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
15 years 9 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
DEXA
2006
Springer
151views Database» more  DEXA 2006»
14 years 11 months ago
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS
Geographic information systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding exact answers to spatial queries can be very time consum...
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 3 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