10608 search results - page 2002 / 2122 » Complexity of O'Hara's Algorithm |
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
GIS
2007
ACM
14 years 11 months ago
2007
ACM
This paper presents an approach to visualize and analyze 3D building information models within virtual 3D city models. Building information models (BIMs) formalize and represent d...
GIS
2009
ACM
14 years 11 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...