Filters








2,031 Hits in 4.4 sec

Lookup Tables: Fine-Grained Partitioning for Distributed Databases

Aubrey L. Tatarowicz, Carlo Curino, Evan P.C. Jones, Sam Madden
2012 2012 IEEE 28th International Conference on Data Engineering  
Ideally, this results in each query/transaction being executed at just one node, to avoid the overhead of distribution and allow the system to scale by adding nodes.  ...  What is needed is a finegrained partitioning, where related individual tuples (e.g., cliques of friends) are co-located together in the same partition.  ...  ACKNOWLEDGEMENTS This work was supported by Quanta Computer as a part of the T-Party Project, and by NSF IIS-III Grant 1065219.  ... 
doi:10.1109/icde.2012.26 dblp:conf/icde/TatarowiczCJM12 fatcat:hkvyk54vsjderkzshurn6sqy4y

GraphSE^2: An Encrypted Graph Database for Privacy-Preserving Social Search [article]

Shangqi Lai and Monash University
2019 arXiv   pre-print
In this paper, we propose GraphSE^2, an encrypted graph database for online social network services to address massive data breaches.  ...  We build GraphSE^2 with various queries supported in the Facebook graph search engine and implement a full-fledged prototype.  ...  Each TSet(w) is identified by an indexing term called stag(w), and all id values in TSet(w) are encrypted via a secret key K w .  ... 
arXiv:1905.04501v1 fatcat:wzolam35gvctzct7d7qs5uhbwe

Reducing MapReduce Abstraction Costs for Text-centric Applications

Chun-Hung Hsiao, Michael Cafarella, Satish Narayanasamy
2014 2014 43rd International Conference on Parallel Processing  
There has been substantial research in improving MapReduce performance for applications that were inspired by relational database queries, but almost none for text-centric applications, including inverted  ...  The former approach improves buffer efficiency for intermediate map outputs by identifying frequent keys, effectively shrinking the amount of work that the shuffle phase must perform.  ...  Reducing work via frequencybuffering can reduce the sorting load on the support thread, thus reducing the map thread's wait time.  ... 
doi:10.1109/icpp.2014.13 dblp:conf/icpp/HsiaoCN14 fatcat:ehhhulkqarg75ddnn2zkniskui

Trust no one

Sharad Jaiswal, Animesh Nandi
2010 Proceedings of the second ACM SIGCOMM workshop on Networking, systems, and applications on mobile handhelds - MobiHeld '10  
In this paper we consider whether it is possible for these entities to exchange information such that a user's queries to the LBS can be answered without i) any one entity coming to know of all sensitive  ...  are in the vicinity of each other.  ...  When multiple businesses are situated in the same PL, tuples are stored in the appended form, for example, the node with identifier '2222' stores an appended tuple of the form <'2700', {B456,B82}>.  ... 
doi:10.1145/1851322.1851336 dblp:conf/sigcomm/JaiswalN10 fatcat:a2dar45arnerxbz5npsms7rtf4

PEAR

Sam Kerr, Michael S. Kirkpatrick, Elisa Bertino
2010 Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS - SPRINGL '10  
We present transaction levels on top of PEAR of as an extension and then discuss some other work that could be done in the future.  ...  In this paper, we present Physically Enhanced Authentication Ring, or PEAR, a system that alleviates this problem.  ...  The output can now be used to uniquely identify the user's device, the service being requested, the user's ID on the service, as well as the user's PIN.  ... 
doi:10.1145/1868470.1868476 dblp:conf/gis/KerrKB10 fatcat:j4t7uod2ybdkzfn6jpoz3xha6i

SQL in the Clouds

James L. Johnson
2009 Computing in science & engineering (Print)  
Following my textbook's approach, 1 I first examine the predicates underlying a SQL query. In abstract terms, I use SQL to identify database tuples satisfying a predicate.  ...  The "L0" prefix sorts this tuple at the beginning of the corresponding library group, because other copy tuples in the group have the "L1" prefix.  ... 
doi:10.1109/mcse.2009.127 fatcat:smz46erm7vc7pa4kkpc4fzmr3e

k-regret queries with nonlinear utilities

Taylor Kessler Faulkner, Will Brackenbury, Ashwin Lall
2015 Proceedings of the VLDB Endowment  
Regret minimization is an approach for selecting k representative points from a database such that every user's ideal point in the entire database is similar to one of the k points.  ...  In exploring representative databases, a primary issue has been finding accurate models of user preferences.  ...  Note that all these bounds are independent of the number of tuples in the database and the distribution of these tuples.  ... 
doi:10.14778/2831360.2831364 fatcat:mbrmz6aorvfqtegti6wn3nc2ga

C-Phrase: A system for building robust natural language interfaces to databases

Michael Minock
2010 Data & Knowledge Engineering  
C-Phrase models queries in an extended version of Codd's tuple calculus and uses synchronous context free grammars with lambda-expressions to represent semantic grammars.  ...  Given an arbitrary relational database, authors rapidly build an NLI using what we term the name-tailor-define protocol.  ...  I would like to acknowledge the hard work of Peter Olofsson and Alexander Näslund for building the AJAX authoring interface.  ... 
doi:10.1016/j.datak.2009.10.007 fatcat:brglceu6svbldnzxfdpjza7fc4

The Doctor Is In: Helping End Users Understand the Health of Distributed Systems [chapter]

Paul Dourish, Daniel C. Swinehart, Marvin Theimer
2000 Lecture Notes in Computer Science  
However, when performance flags or fails, a depiction of system behavior from the user's point of view can be invaluable.  ...  Users need know nothing of the internals of distributed applications that are performing well.  ...  Acknowledgments Mark Spiteri and Karin Petersen built the Bayou-based blackboard repository.  ... 
doi:10.1007/3-540-44460-2_14 fatcat:njahada3efdr5mnhtwrumwqlk4

A Signaling Game Approach to Databases Querying and Interaction [article]

Ben McCamish, Vahid Ghadakchi, Arash Termehchy, Behrouz Touri
2018 arXiv   pre-print
As most users do not precisely know the structure and/or the content of databases, their queries do not exactly reflect their information needs.  ...  The database management systems (DBMS) may interact with users and use their feedback on the returned results to learn the information needs behind their queries.  ...  Algorithms: We compare the algorithm introduced in Section 4.1 against the state-of-the-art and popular algorithm for online learning in information retrieval called UCB-1 [4, 47, 51, 63] .  ... 
arXiv:1603.04068v5 fatcat:u4uj26zhszgw5iir4qalvwxb5e

A universal information appliance

K. F. Eustice, T. J. Lehman, A. Morales, M. C. Munson, S. Edlund, M. Guillen
1999 IBM Systems Journal  
In this paper we describe the design and first implementation of a UIA, a PDA that, through a wireless link, can interact with any program, access any database, or direct most electronic devices through  ...  Using a popular application example, we present a generalized architecture in which the UIA is the mobile user's software portal for interoperating with any peer: another UIA, a common network service,  ...  Acknowledgments The authors thank the TSpaces team, Dwayne Nelson, Keung Hae Lee, John Thomas, and Cal Leister for their valuable comments and contributions.  ... 
doi:10.1147/sj.384.0575 fatcat:pmzd6bfo25ac5d3h64kta3s24e

Possible and Certain Answers for Queries over Order-Incomplete Data [article]

Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
2017 arXiv   pre-print
We show that these problems are respectively NP-complete and coNP-complete, but identify many tractable cases depending on the query operators or input partial orders.  ...  We use partial orders to represent order-incomplete data, and study possible and certain answers for queries in this context.  ...  Clearly the number of such vectors is polynomial, and they uniquely describe all possible ideals of the relation, up to identifying ideals that only differ by elements in the same class which are mapped  ... 
arXiv:1707.07222v1 fatcat:nej4jruulzcuhnxjlghuhsy3i4

Computing Possible and Certain Answers over Order-Incomplete Data [article]

Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart
2019 arXiv   pre-print
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources.  ...  We focus on queries in a useful fragment of SQL, namely positive relational algebra with aggregates, whose bag semantics we extend to the partially ordered setting.  ...  This research was partially supported by the Israeli Science Foundation (grant 1636/13), the Blavatnik ICRC, and Intel.  ... 
arXiv:1801.06396v2 fatcat:7x5gevwrkrdulpd6gzu266qtge

One Size Does Not Fit All: Toward User- and Query-Dependent Ranking for Web Databases

Aditya Telang, Chengkai Li, Sharma Chakravarthy
2012 IEEE Transactions on Knowledge and Data Engineering  
With the emergence of the deep Web, searching Web databases in domains such as vehicles, real estate, etc. has become a routine task.  ...  One of the problems in this context is ranking the results of a user query. Earlier approaches for addressing this problem have used frequencies of database values, query logs, and user profiles.  ...  ACKNOWLEDGEMENTS We thank the anonymous referees for their extremely useful comments and suggestions on an earlier draft of this paper.  ... 
doi:10.1109/tkde.2011.36 fatcat:is2k42usjjal3eot5cxhcamzra

Duoquest: A Dual-Specification System for Expressive SQL Queries [article]

Christopher Baik, Zhongjun Jin, Michael Cafarella, H. V. Jagadish
2020 arXiv   pre-print
Querying a relational database is difficult because it requires users to know both the SQL language and be familiar with the schema.  ...  In a simulation study on the prominent Spider benchmark, Duoquest demonstrates a >2x increase in top-1 accuracy over both NLI and PBE.  ...  We also thank Tao Yu, Bo Pang, and the Yale LILY Lab for assisting us with executing Duoqest on the Spider dataset.  ... 
arXiv:2003.07438v1 fatcat:4oc6emk645eavbaeujg5xakh2i
« Previous Showing results 1 — 15 out of 2,031 results