716 search results - page 80 / 144 » Optimizing Queries in Extended Relational Databases |
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
108
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
WEBDB
2001
Springer
15 years 3 months ago
2001
Springer
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
174
Voted
ICDT
2009
ACM
16 years 16 hour ago
2009
ACM
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
177
click to vote
ICDE
2005
IEEE
16 years 20 days ago
2005
IEEE
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...