1160 search results - page 190 / 232 » Query Processing and Optimization for Pictorial Query Trees |
170
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
TACAS
2007
Springer
15 years 4 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
182
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
WADS
1993
Springer
15 years 2 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...