Architecture-independent distributed query processing

[1]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[2]  Ravi Kumar,et al.  Pig latin: a not-so-foreign language for data processing , 2008, SIGMOD Conference.

[3]  Mukesh Singhal,et al.  Advanced Concepts In Operating Systems , 1994 .

[4]  George Giakkoupis,et al.  On the complexity of greedy routing in ring-based peer-to-peer networks , 2007, PODC '07.

[5]  Robert Tolksdorf.  Query Processing in a Self-Organized Storage System , 2011 .

[6]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[7]  Ihab F. Ilyas,et al.  A survey of top-k query processing techniques in relational database systems , 2008, CSUR.

[8]  Katja Hose,et al.  Distributed Query Processing in P2P Systems with Incomplete Schema Information , 2004, DIWeb.

[9]  Nicoleta Liviana Tudor.  Optimization of Queries with Conjunction of Predicates , 2007, Int. J. Comput. Commun. Control.

[10]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  M. Placek.  A Taxonomy of Distributed Storage Systems , 2007 .

[13]  Werner Vogels,et al.  Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability. , 2022 .

[14]  Andrew S. Tanenbaum,et al.  Distributed systems: Principles and Paradigms , 2001 .

[15]  Mark D. Hill,et al.  What is scalability? , 1990, CARN.

[16]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[17]  Caspar Treijtel.  AmbientDB: Complex Query Processing for P2P Networks , 2003, VLDB PhD Workshop.

[18]  Donald D. Chamberlin,et al.  Access Path Selection in a Relational Database Management System , 1989 .

[19]  Donald Kossmann,et al.  The state of the art in distributed query processing , 2000, CSUR.

[20]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[21]  Dominic Battré,et al.  On Triple Dissemination, Forward-Chaining, and Load Balancing in DHT Based RDF Stores , 2005, DBISP2P.

[22]  Robert Tolksdorf,et al.  Multi-level indexing in a distributed self-organized storage system , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[23]  Marcos K. Aguilera,et al.  Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication , 1997, WDAG.

[24]  Albert Y. Zomaya,et al.  Self-Organizing Content Distribution in a Data Indexed DHT Network , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[25]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[26]  Agata Fronczak,et al.  Average path length in random networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Eric A. Brewer,et al.  Towards robust distributed systems (abstract) , 2000, PODC '00.

[28]  Wolfgang Nejdl,et al.  Distributed Queries and Query Optimization in Schema-Based P2P-Systems , 2003, DBISP2P.

[29]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[30]  B. Bollobás.  The evolution of random graphs , 1984 .

[31]  Robert Tolksdorf,et al.  A self-organized semantic storage service , 2010, iiWAS.

[32]  Arne A. Nilsson,et al.  Measurement and Analysis of Gnutella Signaling Traffic , 2004 .

[33]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[34]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[35]  Panos K. Chrysanthis,et al.  A taxonomy of correctness criteria in database applications , 1996, The VLDB Journal.

[36]  Scott Shenker,et al.  Complex Queries in Dht-based Peer-to-peer Networks , 2002 .

[37]  Hamid Pirahesh,et al.  Robust query processing through progressive optimization , 2004, SIGMOD '04.

[38]  Alan R. Simon,et al.  Understanding the New SQL: A Complete Guide , 1993 .

[39]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[40]  Christian Grothoff,et al.  Bootstrapping of Peer-to-Peer Networks , 2008, 2008 International Symposium on Applications and the Internet.

[41]  Pedro A. Szekely,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Proceedings. First Latin American Web Congress.

[42]  Johann-Christoph Freytag,et al.  A rule-based view of query optimization , 1987, SIGMOD '87.

[43]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[44]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[45]  Vassilis Christophides,et al.  Semantic Query Routing and Processing in P2P Database Systems: The ICS-FORTH SQPeer Middleware , 2004, EDBT Workshops.

[46]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[47]  Hamid Pirahesh,et al.  Extensible/rule based query rewrite optimization in Starburst , 1992, SIGMOD '92.

[48]  Sally McClean,et al.  Heuristic Methods for the Data Placement Problem , 1991 .

[49]  Norman W. Paton,et al.  Adaptive Query Processing: A Survey , 2002, BNCOD.

[50]  M. Kendall,et al.  The Logic of Scientific Discovery. , 1959 .

[51]  R. Kass.  Nonlinear Regression Analysis and its Applications , 1990 .

[52]  Nancy A. Lynch,et al.  Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.

[53]  N. Shadbolt,et al.  4store: The Design and Implementation of a Clustered RDF Store , 2009 .

[54]  Yunhao Liu,et al.  On the reliability of large-scale distributed systems - A topological view , 2009, Comput. Networks.

[55]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[56]  Stephen Todd,et al.  An algebra of relations for machine computation , 1975, POPL '75.

[57]  Luiz André Barroso,et al.  Web Search for a Planet: The Google Cluster Architecture , 2003, IEEE Micro.

[58]  Hannes Mühleisen,et al.  Large-Scale Storage and Reasoning for Semantic Data Using Swarms , 2012, IEEE Computational Intelligence Magazine.

[59]  George Coulouris,et al.  Distributed systems - concepts and designs (3. ed.) , 1994, International computer science series.

[60]  Indranil Gupta,et al.  On scalable and efficient distributed failure detectors , 2001, PODC '01.

[61]  Robert Tappan Morris,et al.  Ivy: a read/write peer-to-peer file system , 2002, OSDI '02.

[62]  David J. DeWitt,et al.  Parallel database systems: the future of high performance database systems , 1992, CACM.

[63]  Erik Buchmann,et al.  Best Effort Query Processing in DHT-based P2P Systems , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

[64]  Walter F. Tichy,et al.  Should Computer Scientists Experiment More? , 1998, Computer.

[65]  Patrick Valduriez,et al.  ASAP Top-k Query Processing in Unstructured P2P Systems , 2010, 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P).

[66]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[67]  Kjell Bratbergsengen,et al.  Hashing Methods and Relational Algebra Operations , 1984, VLDB.

[68]  L. R. Gabler.  Economies and Diseconomies of Scale in Urban Public Sectors , 1969 .

[69]  Joseph M. Hellerstein,et al.  Eddies: continuously adaptive query processing , 2000, SIGMOD '00.

[70]  George Coulouris,et al.  Distributed systems - concepts and design , 1988 .

[71]  GhemawatSanjay,et al.  The Google file system , 2003 .

[72]  Mark C. Chu-Carroll.  Code in the Cloud , 2011 .

[73]  Z. Meral Özsoyoglu,et al.  A complete translation from SPARQL into efficient SQL , 2009, IDEAS '09.

[74]  Theoni Pitoura,et al.  Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks , 2003, DBISP2P.

[75]  W. Shadish,et al.  Experimental and Quasi-Experimental Designs for Generalized Causal Inference , 2001 .

[76]  Piet Van Mieghem,et al.  The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking , 2008, Networking.

[77]  Patrick Valduriez,et al.  Distributed database systems: where are we now? , 1991, Computer.

[78]  Eugenio Cesario,et al.  The XtreemFS architecture—a case for object‐based file systems in Grids , 2008, Concurr. Comput. Pract. Exp..

[79]  David Maier,et al.  Mutant Query Plans , 2002, Inf. Softw. Technol..

[80]  Roberto Segala,et al.  Verification of Randomized Distributed Algorithms , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[81]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[82]  Michael Stonebraker,et al.  The Case for Shared Nothing , 1985, HPTS.

[83]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[84]  Dan Walsh,et al.  Design and implementation of the Sun network filesystem , 1985, USENIX Conference Proceedings.

[85]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[86]  Ajay D. Kshemkalyani,et al.  Distributed Computing: Principles, Algorithms, and Systems , 2008 .

[87]  David Peleg,et al.  The Average Hop Count Measure for Virtual Path Layouts , 2001, DISC.

[88]  E. F. Codd,et al.  The Relational Model for Database Management, Version 2 , 1990 .

[89]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[90]  David S. Johnson,et al.  8. The traveling salesman problem: a case study , 2003 .

[91]  Gary James Jason,et al.  The Logic of Scientific Discovery , 1988 .

[92]  Andreas Reuter,et al.  Principles of transaction-oriented database recovery , 1983, CSUR.

[93]  V. Barnett,et al.  Applied Linear Statistical Models , 1975 .

[94]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[95]  Robert Tolksdorf,et al.  Data location optimization for a self-organized distributed storage system , 2011, 2011 Third World Congress on Nature and Biologically Inspired Computing.

[96]  Verena Kantere,et al.  Querying structured data in an unstructured P2P system , 2004, WIDM '04.

[97]  Anna Philippou,et al.  Verification Techniques for Distributed Algorithms , 2006, OPODIS.

[98]  Peter A. Boncz,et al.  AmbientDB: P2P data management middleware for ambient intelligence , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.

[99]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.

[100]  David J. DeWitt,et al.  Tuple Routing Strategies for Distributed Eddies , 2003, VLDB.

[101]  Dan Suciu,et al.  What Can Database Do for Peer-to-Peer? , 2001, WebDB.

[102]  Anand Rajaraman,et al.  Conjunctive query containment revisited , 1997, Theor. Comput. Sci..

[103]  Robert Tolksdorf,et al.  A survey on self-organized semantic storage , 2011, Int. J. Web Inf. Syst..