Sciweavers

958 search results - page 3 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 2 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ICML
2007
IEEE
14 years 5 months ago
Learning for efficient retrieval of structured data with noisy queries
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
Charles Parker, Alan Fern, Prasad Tadepalli
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 5 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
JSS
2008
139views more  JSS 2008»
13 years 4 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
13 years 8 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng