Sciweavers

6650 search results - page 303 / 1330
» Mutating database queries
Sort
View
CIKM
2009
Springer
15 years 11 months ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang
SIGMOD
2006
ACM
109views Database» more  SIGMOD 2006»
16 years 4 months ago
OMCAT: optimal maintenance of continuous queries' answers for trajectories
We present our prototype system, OMCAT, which optimizes the reevaluation of a set of pending continuous spatio-temporal queries on trajectory data, when some of the trajectories a...
Hui Ding, Goce Trajcevski, Peter Scheuermann
PVLDB
2008
144views more  PVLDB 2008»
15 years 4 months ago
Mining search engine query logs via suggestion sampling
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
Ziv Bar-Yossef, Maxim Gurevich
CACM
1998
110views more  CACM 1998»
15 years 4 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 10 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: 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...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...