1388 search results - page 78 / 278 » Querying Linguistic Trees |
EDBT
2008
ACM
16 years 21 days ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
106
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
185
Voted
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
125
Voted
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
104
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...