Sciweavers

1174 search results - page 171 / 235
» Functional Trees
Sort
View
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
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
MIDDLEWARE
2007
Springer
14 years 4 months ago
A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications
Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supp...
Jianjun Zhang, Ling Liu, Lakshmish Ramaswamy, Gong...
EWSN
2004
Springer
14 years 3 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 3 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...