415 search results - page 4 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
SUM
2007
Springer
14 years 15 days ago
2007
Springer
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
BTW
2005
Springer
13 years 12 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
WAIM
2010
Springer
13 years 4 months ago
2010
Springer
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
SIGMOD
2008
ACM
13 years 6 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...