Sciweavers

591 search results - page 67 / 119
» The complexity of XPath query evaluation
Sort
View
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 9 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
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
VLDB
1998
ACM
121views Database» more  VLDB 1998»
14 years 27 days ago
Hash Joins and Hash Teams in Microsoft SQL Server
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...
Goetz Graefe, Ross Bunker, Shaun Cooper
DBVIS
1993
101views Database» more  DBVIS 1993»
14 years 23 days ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 10 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...