Sciweavers

611 search results - page 20 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
DDEP
2000
Springer
14 years 11 hour ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
11 years 10 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...
PODS
2002
ACM
167views Database» more  PODS 2002»
14 years 7 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
SIGIR
2010
ACM
13 years 7 months ago
Exploiting click-through data for entity retrieval
We present an approach for answering Entity Retrieval queries using click-through information in query log data from a commercial Web search engine. We compare results using click...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
14 years 1 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma