Sciweavers

220 search results - page 25 / 44
» Supporting Queries with Imprecise Constraints
Sort
View
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 7 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
DAWAK
2001
Springer
14 years 3 days ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
14 years 13 days ago
Processing proximity relations in road networks
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...
Zhengdao Xu, Hans-Arno Jacobsen
VLDB
2005
ACM
126views Database» more  VLDB 2005»
14 years 1 months ago
Hubble: An Advanced Dynamic Folder Technology for XML
A significant amount of information is stored in computer systems today, but people are struggling to manage their documents such that the information is easily found. XML is a de...
Ning Li, Joshua Hui, Hui-I Hsiao, Kevin S. Beyer
GIS
2008
ACM
13 years 8 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...