Sciweavers

29 search results - page 4 / 6
» A fast XPATH evaluation technique with the facility of updat...
Sort
View
EDBT
2009
ACM
164views Database» more  EDBT 2009»
14 years 7 days ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
VLDB
2010
ACM
190views Database» more  VLDB 2010»
13 years 6 months ago
Continuous authentication on relational streams
According to the database outsourcing model, a data owner delegates database functionality to a thirdparty service provider, which answers queries received from clients. Authentic...
Stavros Papadopoulos, Yin Yang, Dimitris Papadias
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 9 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 1 months ago
Landmark-Based Routing in Dynamic Graphs
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 ...
Daniel Delling, Dorothea Wagner