Sciweavers

143 search results - page 17 / 29
» Efficient Region Query Processing by Optimal Page Ordering
Sort
View
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 8 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
SIGMOD
2009
ACM
165views Database» more  SIGMOD 2009»
14 years 1 months ago
Query by output
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in t...
Quoc Trung Tran, Chee-Yong Chan, Srinivasan Partha...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 13 days ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 8 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
DKE
2006
123views more  DKE 2006»
13 years 8 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...