Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A performance analysis of view materialization strategies
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
IEEE Transactions on Software Engineering
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Multiprocessor transitive closure algorithms
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Incorporating hierarchy in a relational model of data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Readings in Knowledge Representation
Readings in Knowledge Representation
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Database Support for Knowledge-Based Image Evaluation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
New Strategies for Computing the Transitive Closure of a Database Relation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Static type checking of multi-methods
OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Implementing hypertext database relationships through aggregations and exception
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Spatial data traversal in road map databases: a graph indexing approach
CIKM '94 Proceedings of the third international conference on Information and knowledge management
ACM Transactions on Database Systems (TODS)
Fast algorithms for compressed multimethod dispatch table generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental encoding of multiple inheritance hierarchies
Proceedings of the eighth international conference on Information and knowledge management
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
String realizers of posets with applications to distributed computing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Efficient subtyping tests with PQ-encoding
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A fine-grained access control system for XML documents
ACM Transactions on Information and System Security (TISSEC)
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
A Persistent Store for Large Shared Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
Efficient Query Processing for a Subset of Linear Recursive Binary Rules
IEEE Transactions on Knowledge and Data Engineering
Description and Identification of Distributed Fragments of Recursive Relations
IEEE Transactions on Knowledge and Data Engineering
Efficient transitive closure reasoning in a combined class/part/containment hierarchy
Knowledge and Information Systems
Distributed Transitive Closure Computations: The Disconnection Set Approach
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient Main Memory Data Management Using the DBGraph Storage Model
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
On Maintaining Priorities in a Production Rule System
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
An Approach to Classify Semi-structured Objects
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Querying the Semantic Web with RQL
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: The Semantic Web: an evolution for a revolution
Encoding multiple inheritance hierarchies for lattice operations
Data & Knowledge Engineering
Efficient Algorithms for Pattern Matching on Directed Acyclic Graphs
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient subtyping tests with PQ-encoding
ACM Transactions on Programming Languages and Systems (TOPLAS)
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
Proceedings of the 14th ACM international conference on Information and knowledge management
Compact reachability labeling for graph-structured data
Proceedings of the 14th ACM international conference on Information and knowledge management
SLS: A numbering scheme for large XML documents
Programming and Computing Software
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
User notification in taxonomy based digital libraries
SIGDOC '06 Proceedings of the 24th annual ACM international conference on Design of communication
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient distributed subtyping tests
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Extensible encoding of type hierarchies
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Indexing views to route queries in a PDMS
Distributed and Parallel Databases
Journal of Systems and Software
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
Efficient algorithms for exact ranked twig-pattern matching over graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
EVEY: enhancing privacy of service discovery in pervasive computing
Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion
Perfect hashing as an almost perfect subtype test
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchy Encoding with Multiple Genes
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Preserving confidentiality of security policies in data outsourcing
Proceedings of the 7th ACM workshop on Privacy in the electronic society
Indexing Method for Transitive Relationships of Product Information
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
CPref-SQL: a query language supporting conditional preferences
Proceedings of the 2009 ACM symposium on Applied Computing
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Learning, indexing, and diagnosing network faults
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Evaluating Reachability Queries over Path Collections
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
A Hybrid Method of Indexing Multiple-Inheritance Hierarchies
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Vivid knowledge and tractable reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Efficient retrieval of ontology fragments using an interval labeling scheme
Information Sciences: an International Journal
Optimizing updates of recursive XML views of relations
The VLDB Journal — The International Journal on Very Large Data Bases
Query Evaluation on Probabilistic RDF Databases
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Fast user notification in large-scale digital libraries: experiments and results
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Cost-based query optimization for multi reachability joins
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
OntoPath: a language for retrieving ontology fragments
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
On storage policies for semantic web repositories that support versioning
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An optimal labeling scheme for workflow provenance using skeleton labels
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
Path-hop: efficiently indexing large graphs for reachability queries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A hierarchical approach to reachability query answering in very large graph databases
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
On-line preferential nearest neighbor browsing in large attributed graphs
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
On enhancing scalability for distributed RDF/S stores
Proceedings of the 14th International Conference on Extending Database Technology
Labeling recursive workflow executions on-the-fly
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Summarizing transactional databases with overlapped hyperrectangles
Data Mining and Knowledge Discovery
Classifying graphs using theoretical metrics: a study of feasibility
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
BMC: an efficient method to evaluate probabilistic reachability queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Join-reachability problems in directed graphs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
LogMap: logic-based and scalable ontology matching
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Predicting the optimal ad-hoc index for reachability queries on graph databases
Proceedings of the 20th ACM international conference on Information and knowledge management
An efficient scheme to completely avoid re-labeling in XML updates
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Labeling scheme and structural joins for graph-structured XML data
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Reuse or never reuse the deleted labels in XML query processing based on labeling schemes
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Fast reachability query processing
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Subgraph join: efficient processing subgraph queries on graph-structured XML document
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Using compact encodings for path-based computations on pedigree graphs
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
An improved prefix labeling scheme: a binary string approach for dynamic ordered XML
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Querying ontologies in relational database systems
DILS'05 Proceedings of the Second international conference on Data Integration in the Life Sciences
Journal of Biomedical Informatics
Comments on "Stack-based Algorithms for Pattern Matching on DAGs"
Proceedings of the VLDB Endowment
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
SCARAB: scaling reachability computation on large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
I/O cost minimization: reachability queries processing over massive graphs
Proceedings of the 15th International Conference on Extending Database Technology
Access control in social networks: a reachability-based approach
Proceedings of the 2012 Joint EDBT/ICDT Workshops
K-reach: who is in your small world
Proceedings of the VLDB Endowment
An efficient encoding and labeling scheme for dynamic XML data
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
RDF-4G: algorithmic building blocks for large-scale graph analytics
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
Sparqling kleene: fast property paths in RDF-3X
First International Workshop on Graph Data Management Experiences and Systems
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Generalized Hybrid Encoding of Polyhierarchical Structures
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
We argue that accessing the transitive closure of relationships is an important component of both databases and knowledge representation systems in Artificial Intelligence. The demands for efficient access and management of large relationships motivate the need for explicitly storing the transitive closure in a compressed and local way, while allowing updates to the base relation to be propagated incrementally. We present a transitive closure compression technique, based on labeling spanning trees with numeric intervals, and provide both analytical and empirical evidence of its efficacy, including a proof of optimality.