Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2016
Querying Graphs with Data
Journal of the ACM (JACM), Volume 63, Issue 2Article No.: 14, Pages 1–53https://doi.org/10.1145/2850413Graph databases have received much attention as of late due to numerous applications in which data is naturally viewed as a graph; these include social networks, RDF and the Semantic Web, biological databases, and many others. There are many proposals ...
- research-articleJune 2013
On XPath with transitive axes and data tests
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systemsPages 249–260https://doi.org/10.1145/2463664.2463675We study the satisfiability problem for XPath with data equality tests. XPath is a node selecting language for XML documents whose satisfiability problem is known to be undecidable, even for very simple fragments. However, we show that the ...
- research-articleMarch 2013
Querying graph databases with XPath
ICDT '13: Proceedings of the 16th International Conference on Database TheoryPages 129–140https://doi.org/10.1145/2448496.2448513XPath plays a prominent role as an XML navigational language due to several factors, including its ability to express queries of interest, its close connection to yardstick database query languages (e.g., first-order logic), and the low complexity of ...
- research-articleOctober 2012
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL), Volume 13, Issue 4Article No.: 34, Pages 1–40https://doi.org/10.1145/2362355.2362362We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes, and tests for (in)equality of attributes’ values. We prove that this problem is decidable, EXPTIME-complete. These bounds ...
- research-articleSeptember 2012
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS), Volume 37, Issue 3Article No.: 19, Pages 1–28https://doi.org/10.1145/2338626.2338632Data trees provide a standard abstraction of XML documents with data values: they are trees whose nodes, in addition to the usual labels, can carry labels from an infinite alphabet (data). Therefore, one is interested in decidable formalisms for ...
- research-articleMarch 2012
Regular path queries on graphs with data
ICDT '12: Proceedings of the 15th International Conference on Database TheoryPages 74–85https://doi.org/10.1145/2274576.2274585Graph data models received much attention lately due to applications in social networks, semantic web, biological databases and other areas. Typical query languages for graph databases retrieve their topology, while actual data stored in them is usually ...
- research-articleMarch 2011
Efficient reasoning about data trees via integer linear programming
ICDT '11: Proceedings of the 14th International Conference on Database TheoryPages 18–29https://doi.org/10.1145/1938551.1938558Data trees provide a standard abstraction of XML documents with data values: they are trees whose nodes, in addition to the usual labels, can carry labels from an infinite alphabet (data). Therefore, one is interested in decidable formalisms for ...
- research-articleJune 2009
Satisfiability of downward XPath with data equality tests
PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsPages 197–206https://doi.org/10.1145/1559795.1559827In this work we investigate the satisfiability problem for the logic XPath(↓*, ↓,=), that includes all downward axes as well as equality and inequality tests. We address this problem in the absence of DTDs and the sibling axis. We prove that this ...
- ArticleOctober 1997
Managing multiple focal levels in Table Lens
INFOVIS '97: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)Page 59The Table Lens, focus+context visualization for large data tables, allows users to see 100 times as many data values as a spreadsheet in the same screen space in a manner that enables an extremely immediate form of exploratory data analysis. In the ...
- ArticleMay 1995
Synthesis of protocol entities specifications from service specifications in a Petri net model with registers
ICDCS '95: Proceedings of the 15th International Conference on Distributed Computing SystemsPage 510Abstract: In general, the services of a distributed system are provided by some cooperative protocol entities. The protocol entities must exchange some data values and synchronization messages in order to ensure the temporal ordering of the events which ...
- research-articleJanuary 1994
Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters
IEEE Transactions on Software Engineering (ISOF), Volume 20, Issue 1Pages 29–42https://doi.org/10.1109/32.263753We propose an automatic analysis and test case derivation method for LOTOS expressions with data values. We introduce the class of P-LOTOS expressions where the data types are restricted to Presburger arithmetic. That is, only the integer and Boolean ...
- research-articleAugust 1990
Redundant Logarithmic Arithmetic
IEEE Transactions on Computers (ITCO), Volume 39, Issue 8Pages 1077–1086https://doi.org/10.1109/12.57046A number system that offers advantages in some situations over conventional floating point and sign/logarithmic number systems is described. Redundant logarithmic arithmetic, like conventional logarithmic arithmetic, relies on table lookups to make the ...