Sciweavers

611 search results - page 33 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
IPAW
2010
13 years 5 months ago
Janus: From Workflows to Semantic Provenance and Linked Open Data
Data provenance graphs are form of metadata that can be used to establish a variety of properties of data products that undergo sequences of transformations, typically specified as...
Paolo Missier, Satya Sanket Sahoo, Jun Zhao, Carol...
COMPGEOM
2010
ACM
14 years 24 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 7 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
14 years 7 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...
ICDAR
2011
IEEE
12 years 7 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...