1018 search results - page 83 / 204 » On the minimization of XPath queries |
109
click to vote
DASFAA
2004
IEEE
15 years 5 months ago
2004
IEEE
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
136
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
121
click to vote
EDBT
2004
ACM
16 years 1 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...
161
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
We present Stretch `n' Shrink, a query design framework that explicitly takes into account user preferences about the desired answer size, and subsequently modifies the query...
113
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
This paper proposes a strategy to reduce the amount of hardware involved in the solution of search engine queries. It proposes using a secondary compact cache that keeps minimal i...