Sciweavers

736 search results - page 102 / 148
» Confidence-Aware Join Algorithms
Sort
View
ICCS
2004
Springer
14 years 3 months ago
ABSDM: Agent Based Service Discovery Mechanism in Internet
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...
Shijian Li, Congfu Xu, Zhaohui Wu, Yunhe Pan, Xuel...
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 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
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 10 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 3 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello