611 search results - page 77 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
IWPC
2005
IEEE
14 years 3 months ago
2005
IEEE
Source code can be viewed in many ways, with each view facilitating access to different information contained within the code. In this working session, we will explore the role th...
WEA
2007
Springer
14 years 4 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
MDM
2009
Springer
14 years 4 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...