1042 search results - page 25 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
MOBIDE
2005
ACM
14 years 1 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...