Sciweavers

591 search results - page 50 / 119
» The complexity of XPath query evaluation
Sort
View
GEOS
2009
Springer
14 years 1 months ago
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
Prateek Jain, Peter Z. Yeh, Kunal Verma, Cory A. H...
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
14 years 1 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 1 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
DASFAA
2007
IEEE
161views Database» more  DASFAA 2007»
14 years 3 months ago
GChord: Indexing for Multi-Attribute Query in P2P System with Low Maintenance Cost
Abstract. To provide complex query processing in peer-to-peer systems has attracted much attention in both academic and industrial community. We present GChord, a scalable techniqu...
Minqi Zhou, Rong Zhang, Weining Qian, Aoying Zhou
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
12 years 11 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang