Sciweavers

591 search results - page 54 / 119
» The complexity of XPath query evaluation
Sort
View
ICDT
1995
ACM
105views Database» more  ICDT 1995»
14 years 8 days ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
IEEEVAST
2010
13 years 3 months ago
Interactive querying of temporal data using a comic strip metaphor
Finding patterns in temporal data is an important data analysis task in many domains. Static visualizations can help users easily see certain instances of patterns, but are not sp...
Jing Jin, Pedro A. Szekely
P2P
2005
IEEE
104views Communications» more  P2P 2005»
14 years 2 months ago
Range Queries in Trie-Structured Overlays
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
Anwitaman Datta, Manfred Hauswirth, Renault John, ...
GIS
2006
ACM
14 years 9 months ago
On-line maintenance of simplified weighted graphs for efficient distance queries
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
Floris Geerts, Peter Z. Revesz, Jan Van den Bussch...
ICDE
2000
IEEE
113views Database» more  ICDE 2000»
14 years 1 months ago
Web Query Optimizer
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
Vladimir Zadorozhny, Laura Bright, Louiqa Raschid,...