Sciweavers

4192 search results - page 426 / 839
» Efficient testing of groups
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 6 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
16 years 6 months ago
Query segmentation using conditional random fields
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...
Xiaohui Yu, Huxia Shi
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 6 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
EDBT
2008
ACM
124views Database» more  EDBT 2008»
16 years 6 months ago
Scalable XQuery type matching
XML Schema awareness has been an integral part of the XQuery language since its early design stages. Matching XML data against XML types is the main operation that backs up XQuery...
Jens Teubner
PERCOM
2008
ACM
16 years 5 months ago
Budget-Based Clustering with Context-awareness for Sensor Networks
As the scale of modern sensor networks continues to grow, energy consumption, scalability and routing efficiency are becoming key design challenges. Network management plays an im...
Jiaxi You, Dominik Lieckfeldt, Matthias Handy, Dir...