Sciweavers

848 search results - page 62 / 170
» Optimization of Sequence Queries in Database Systems
Sort
View
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 9 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
APWEB
2010
Springer
14 years 1 months ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
PETRA
2010
ACM
13 years 10 months ago
Benchmarking dynamic time warping for music retrieval
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
Jefrey Lijffijt, Panagiotis Papapetrou, Jaakko Hol...
VLDB
2001
ACM
168views Database» more  VLDB 2001»
14 years 9 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 1 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...