Filters








10,912 Hits in 8.8 sec

Processing Regular Path Queries on Arbitrarily Distributed Data [article]

Alan Davoust, Babak Esfandiari
2015 arXiv   pre-print
We study the techniques to process such queries on a distributed graph of data.  ...  Regular Path Queries (RPQs) are a type of graph query where answers are pairs of nodes connected by a sequence of edges matching a regular expression.  ...  In this paper, we study the problem of processing regular path queries over distributed data.  ... 
arXiv:1510.04347v1 fatcat:xmamt2spevhf7cz4aea5ur5diu

Processing Regular Path Queries on Arbitrarily Distributed Data [chapter]

Alan Davoust, Babak Esfandiari
2016 Lecture Notes in Computer Science  
We study the techniques to process such queries on a distributed graph of data.  ...  Regular Path Queries (RPQs) are a type of graph query where answers are pairs of nodes connected by a sequence of edges matching a regular expression.  ...  In this paper, we study the problem of processing regular path queries over distributed data.  ... 
doi:10.1007/978-3-319-48472-3_53 fatcat:kmd6bdhwkjefhd6qwdxziwdqru

Regular path queries with constraints

Serge Abiteboul, Victor Vianu
1997 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97  
The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered.  ...  The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries.  ...  The distributed processing of path queries can be greatly enhanced by taking advantage of path constraints.  ... 
doi:10.1145/263661.263676 dblp:conf/pods/AbiteboulV97 fatcat:ur4y3vrwevdm3p3dz2c6dgpsee

Regular Path Queries with Constraints

Serge Abiteboul, Victor Vianu
1999 Journal of computer and system sciences (Print)  
The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered.  ...  The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries.  ...  The distributed processing of path queries can be greatly enhanced by taking advantage of path constraints.  ... 
doi:10.1006/jcss.1999.1627 fatcat:iojdp3lyebfv3mvynvjkwfmq3u

Performance guarantees for distributed reachability queries

Wenfei Fan, Xin Wang, Yinghui Wu
2012 Proceedings of the VLDB Endowment  
a path of a bounded length between a pair of nodes, and regular reachability for checking whether there exists a path connecting two nodes such that the node labels on the path form a string in a given  ...  In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs.  ...  Fan, Wang and Wu are supported in part by the 973 Program 2012CB316200 and NSFC 61133002 of China, and in part by EPSRC EP/J015377/1, an IBM scalable data analytics for a smarter planet innovation award  ... 
doi:10.14778/2350229.2350248 fatcat:d4pxr7elkrgs5dwcrevxttd3q4

Performance Guarantees for Distributed Reachability Queries [article]

Wenfei Fan, Xin Wang, Yinghui Wu
2012 arXiv   pre-print
a path of a bounded length between a pair of nodes, and regular reachability for checking whether there exists a path connecting two nodes such that the node labels on the path form a string in a given  ...  In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs.  ...  Fan, Wang and Wu are supported in part by the 973 Program 2012CB316200 and NSFC 61133002 of China, and in part by EPSRC EP/J015377/1, an IBM scalable data analytics for a smarter planet innovation award  ... 
arXiv:1208.0091v1 fatcat:anuuxcceivgpzn4c34xagdgbuy

Page 9233 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
Summary: “We introduce a search problem called ‘mutual search’ where k agents, arbitrarily distributed over n sites, are required to locate one another by posing queries of the form ‘anybody at site /?  ...  that are unreliable, i.e., that cannot distinguish crashed processes from correct ones.  ... 

DeepOLA: Online Aggregation for Deeply Nested Queries

Nikhil Sheoran
2022 Proceedings of the 2022 International Conference on Management of Data  
Hence, when we process the query on incremental data, the partially computed results need not be merged at the WHERE node and can be merged at the GROUP BY AGG node (the last merge-able node in the path  ...  Thus, we can arbitrarily nest multiple such queries.  ... 
doi:10.1145/3514221.3520249 fatcat:jevbvyhc4za7tnm2bvsuasroum

EMMA – A Query Algebra for Enhanced Multimedia Meta Objects [chapter]

Sonja Zillner, Utz Westermann, Werner Winiwarter
2004 Lecture Notes in Computer Science  
For the processing of EMMOs and the knowledge they contain, suitable querying facilities are required.  ...  within queries.  ...  Acknowledgement We would like to thank Bernhard Haslhofer for his work on the implementation of the EMMA query algebra.  ... 
doi:10.1007/978-3-540-30469-2_13 fatcat:auodfyudljcxbdadpzmhpc6hvq

Virtual and Consistent Hyperbolic Tree: A New Structure for Distributed Database Management [chapter]

Telesphore Tiendrebeogo, Damien Magoni
2015 Lecture Notes in Computer Science  
This structure is intended for supporting queries over possibly large spatial datasets distributed over interconnected servers.  ...  It uses a distributed balanced Q-degree spatial tree that scales with data objects' insertions into potentially any number of storage servers through virtual hyperbolic coordinates.  ...  The routing process is done on each database server on the path (starting from the sender) by using Algorithm 2, a greedy algorithm based on the hyperbolic distances between the servers.  ... 
doi:10.1007/978-3-319-26850-7_28 fatcat:4mwy4jhlsjadheagwikf2t4ihm

Fangorn: A System for Querying very large Treebanks

Sumukh Ghodke, Steven Bird
2012 International Conference on Computational Linguistics  
In many such cases manual processing is required, and this must operate efficiently on the largest scale. We report on an efficient web-based system for querying very large treebanks called Fangorn.  ...  Query results are displayed using scalable vector graphics and decorated with the original query, making it easy for queries to be modified and resubmitted.  ...  Paths can be arbitrarily long, e.g. //NP=>S//VP->NN/table; each time we add a step, we further restrict the number of possible matching trees.  ... 
dblp:conf/coling/GhodkeB12 fatcat:ileefgtqfbe3dhdwjnilmdzrna

SENSS: Software Defined Security Service

Minlan Yu, Ying Zhang, Jelena Mirkovic, Abdulla Alwabel
2014 Open Networking Summit  
The implications of network attacks on the victim can be huge. For example a distributed denial-of-service (DDoS) can overwhelm the victim and make it unable to handle its regular business.  ...  Besides the data plane attacks, control plane misconfigurations and attacks on the interdomain routing protocol BGP [3] can have dire implications for victim networks.  ...  , <path1>, <path2> modify the false AS path segment to the correct one  ... 
dblp:conf/ons/YuZMA14 fatcat:qlqgzjrfczewnnoghu6lwefnoe

Distributed query evaluation on semistructured data

Dan Suciu
2002 ACM Transactions on Database Systems  
Semistructured data is modeled as a rooted, labeled graph. The simplest kinds of queries on such data are those which traverse paths described by regular path expressions.  ...  More complex queries combine several regular path expressions, with complex data restructuring, and with sub-queries.  ...  QUERIES WITH REGULAR PATH EXPRESSIONS We describe in this section the simplest kind of queries on semistructured data: regular path expression queries.  ... 
doi:10.1145/507234.507235 fatcat:njovl2ichze65ineqrffrcqpka

Scalable Decentralized Control for Sensor Networks via Distributed Lattices [chapter]

Baruch Awerbuch, Jonathan Stanton
2003 Lecture Notes in Computer Science  
Moreover, we show a completely distributed implementation of such structures, that creates minimal overload on the client sensors.  ...  distortion of paths.  ...  There is also work on aggregating data from different sources via distributed approximate set cover algorithms [11] .  ... 
doi:10.1007/3-540-36978-3_24 fatcat:aje3cagal5dvxgj7g7fvfnbkue

SPARQ2L

Kemafor Anyanwu, Angela Maduko, Amit Sheth
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
The aim of such queries is to "extract" relationships between entities i.e. paths from a data graph.  ...  techniques for solving path problems which allows for path queries to be efficiently evaluated on disk resident RDF graphs.  ...  Then, different preprocessing steps are performed on the data which produces appropriate indexes on the data for each of the querying paradigms i.e.  ... 
doi:10.1145/1242572.1242680 dblp:conf/www/AnyanwuMS07 fatcat:jfgbbp4fejb7jbru6fz2q5iaua
« Previous Showing results 1 — 15 out of 10,912 results