1042 search results - page 75 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
The emergence of the Web has increased interests in XML data. XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured data. Without a s...
ICDE
2001
IEEE
14 years 9 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by da...
WEBI
2001
Springer
14 years 7 days ago
2001
Springer
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
STOC
1998
ACM
14 years 1 days ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...