Sciweavers

734 search results - page 63 / 147
» Efficient join processing over uncertain data
Sort
View
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
15 years 10 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
SUTC
2010
IEEE
14 years 8 months ago
Effective Metadata Management in Federated Sensor Networks
—As sensor networks become increasingly popular, heterogeneous sensor networks are being interconnected into federated sensor networks and provide huge volumes of sensor data to ...
Hoyoung Jeung, Sofiane Sarni, Ioannis Paparrizos, ...
GIS
2007
ACM
15 years 11 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
ICDE
2008
IEEE
135views Database» more  ICDE 2008»
15 years 11 months ago
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
Bhargav Kanagal, Amol Deshpande
WAIM
2004
Springer
15 years 3 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng