709 search results - page 78 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
180
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
151
click to vote
DIWEB
2004
15 years 7 months ago
2004
The peer-to-peer (P2P) paradigm has emerged recently, mainly by file sharing systems like Napster or Gnutella and in terms of scalable distributed data structures. Because of the d...
165
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
167
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
172
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
We present a framework for publishing relational data in XML with respect to a fixed DTD. In data exchange on the Web, XML views of relational data are typically required to confo...