sigmod 2014文章

SIGMOD 2014: Accepted Research Papers

  • AutoPlait: Automatic Mining of Co-evolving Time Sequences 
    Yasuko Matsubara, Kumamoto University; Yasushi Sakurai, Kumamoto University; Christos Faloutsos, Carnegie Mellon University
  • Resource-Oriented Approximation for Frequent Itemset Mining from Bursty Data Streams
    Yoshitaka Yamamoto, University of Yamanashi; Koji Iwanuma, University of Yamanashi; Shoshi Fukuda, University of Yamanashi
  • On Complexity and Optimization of Expensive Queries in Complex Event Processing
    Haopeng Zhang, UMass Amherst; Yanlei Diao, UMass Amherst; Neil Immerman, UMass Amherst
  • Complex Event Analytics: Online Aggregation of Stream Sequence Patterns
    Yingmei Qi, Google Inc; Lei Cao, Worcester Polytechnic Institute; Medhabi Ray, Worcester Polytechnic Institute; Elke Rundensteiner, Worcester Polytechnic Institute
  • Explainable Security for Relational Databases
    Gabriel Bender, Cornell University; Lucja Kot, Cornell University; Johannes Gehrke, Cornell University
  • PrivBayes: Private Data Release via Bayesian Networks
    Jun Zhang, Nanyang Technological University; Graham Cormode, University of Warwick; Cecilia Procopiuc, AT&T Labs Research; Divesh Srivastava, AT&T Labs Research; Xiaokui Xiao, Nanyang Technological University
  • PriView: Practical Differentially Private Release of Marginal Contingency Tables
    Wahbeh Qardaji, Purdue University; Weining Yang, Purdue University; Ninghui Li, Purdue University
  • Blowfish Privacy: Tuning Privacy-Utility Trade-offs using Policies
    Xi He, Duke University; Ashwin Machanavajjhala, Duke University; Bolin Ding, Microsoft Research
  • PLANET: Making Progress with Commit Processing in Unpredictable Environments
    Gene Pang, UC Berkeley; Tim Kraska, Brown University; Michael Franklin, UC Berkeley; Alan Fekete, University of Sydney
  • Lazy Evaluation of Transactions in Database Systems
    Jose Faleiro, Yale University; Alexander Thomson, Google Inc; Daniel Abadi, Yale University
  • Scalable Atomic Visibility with RAMP Transactions
    Peter Bailis, UC Berkeley; Alan Fekete, University of Sydney; Joseph Hellerstein, UC Berkeley; Ali Ghodsi, UC Berkeley; Ion Stoica, UC Berkeley
  • JECB: a Join-Extension, Code-Based Approach to OLTP Data Partitioning
    Khai Tran, University of Wisconsin Madison; Jeffrey Naughton, University of Wisconsin Madison; Bruhathi Sundarmurthy, University of Wisconsin Madison; Dimitris Tsirogiannis, University of Wisconsin Madison
  • Parallel Data Analysis Directly on Scientific File Formats
    Spyros Blanas, Ohio State University; John Wu, Lawrence Berkeley National Lab; Suren Byna, Lawrence Berkeley National Lab; Bin Dong, Lawrence Berkeley National Lab; Arie Shoshani, Lawrence Berkeley National Lab
  • The PH-Tree - A Space-Efficient Storage Structure and Multi-Dimensional Index
    Tilmann Zaschke, ETH Zurich; Christoph Zimmerli, ETH Zurich; Moira Norrie, ETH Zurich
  • Incremental Elasticity For Array Databases
    Jennie Duggan, MIT; Michael Stonebraker, MIT
  • Efficient Summarization Framework for Multi-Attribute Uncertain Data
    Jie Xu, UC Irvine; Dmitri V. Kalashnikov, UC Irvine; Sharad Mehrotra, UC Irvine
  • Towards Indexing Functions: Answering Scalar Product Queries
    Arijit Khan, ETH Zurich; Pouya Yanki, ETH Zurich; Bojana Dimcheva, ETH Zurich; Donald Kossmann, ETH Zurich
  • LINVIEW: Incremental View Maintenance for Complex Analytical Queries
    Milos Nikolic, EPFL; Mohammed ElSeidy, EPFL; Christoph Koch, EPFL
  • Materialization Optimizations for Feature Selection Workloads
    Ce Zhang, University of Wisconsin Madison; Arun Kumar, University of Wisconsin Madison; Christopher Re, Stanford University
  • The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing
    Kai Zeng, UCLA; Shi Gao, UCLA; Barzan Mozafari, University of Michigan; Carlo Zaniolo, UCLA
  • Patience is a Virtue: Revisiting Merge and Sort on Modern Processors
    Badrish Chandramouli, Microsoft Research; Jonathan Goldstein, Microsoft Research
  • Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age
    Viktor Leis, TU Munchen; Peter Boncz, CWI; Alfons Kemper, TU Munchen; Thomas Neumann, TU Munchen
  • A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison and Radix-Sort
    Orestis Polychroniou, Columbia University; Kenneth Ross, Columbia University
  • An Application-Specific Instruction Set for Accelerating Set-Oriented Database Primitives
    Oliver Arnold, TU Dresden; Sebastian Haas, TU Dresden; Gerhard Fettweis, TU Dresden; Benjamin Schlegel, TU Dresden; Thomas Kissinger, TU Dresden; Wolfgang Lehner, TU Dresden
  • Scalable Big Graph Processing in MapReduce
    Lu Qin, University of Technology Sydney; Jeffrey Yu, Chinese University of Hong Kong; Lijun Chang, University of New South Wales; Hong Cheng, Chinese University of Hong Kong; Chengqi Zhang, University of Technology Sydney; Xuemin Lin, University of New South Wales
  • Anti-Combining for MapReduce
    Alper Okcan, Northeastern University; Mirek Riedewald, Northeastern University
  • Opportunistic Physical Design for Big Data Analytics
    Jeff LeFevre, UC Santa Cruz; Jagan Sankaranarayanan, NEC Labs America; Hakan Hacigumus, NEC Labs America; Junichi Tatemura, NEC Labs America; Neoklis Polyzotis, UC Santa Cruz; Michael Carey, UC Irvine
  • Stratified-Sampling over Social Networks Using MapReduce
    Roy Levin, IBM Haifa Research Lab; Yaron Kanza, Jacobs Technion-Cornell Innovation Institute, Cornell Tech
  • Characterizing and Selecting Fresh Data Sources
    Theodoros Rekatsinas, University of Maryland; Xin Dong, Google Inc; Divesh Srivastava, AT&T Labs Research
  • Sloth: Being Lazy is a Virtue (When Issuing Database Queries)
    Alvin Cheung, MIT; Sam Madden, MIT; Armando Solar-Lezama, MIT
  • Dynamically Optimizing Queries for Large Scale Data Platforms
    Konstantinos Karanasos, IBM Almaden Research Center; Andrey Balmin, GraphSQL; Marcel Kutsch, Apple Inc.; Fatma Ozcan, IBM Almaden Research Center; Vuk Ercegovac, Google, Inc.; Chunyang Xia, IBM; Jesse Jackson, IBM
  • A Software-Defined Networking based Approach for Performance Management of Analytical Queries on Distributed Data Stores
    Pengcheng Xiong, NEC Labs America; Hakan Hacigumus, NEC Labs America; Jeffrey Naughton, University of Wisconsin Madison
  • Online Optimization and Fair Costing for Dynamic Data Sharing in a Cloud Data Market
    Ziyang Liu, NEC Labs America; Hakan Hacigumus, NEC Labs America
  • A Comparison of Platforms for Implementing and Running Very Large Scale Machine Learning Algorithms
    Zhuhua Cai, Rice University; Zekai Gao, Rice University; Shangyu Luo, Rice University; Luis Perez, Rice University; Zografoula Vagena, LogicBlox Inc; Christopher Jermaine, Rice University
  • Re-evaluating Designs for Multi-Tenant OLTP Workloads on SSD-based I/O Subsystems
    Ning Zhang, University of Wisconsin Madison; Junichi Tatemura, NEC Labs America; Jignesh Patel, University of Wisconsin Madison; Hakan Hacigumus, NEC Labs America
  • Secure Query Processing with Data Interoperability in a Cloud Database Environment
    Wai Kit Wong, Hang Seng Management College; Ben Kao, University of Hong Kong; David Wai Lok Cheung, University of Hong Kong; Rongbin Li, University of Hong Kong; Siu Ming Yiu, University of Hong Kong
  • HYDRA: Large-scale Social Identity Linkage via Heterogeneous Behavior Modeling
    Siyuan Liu, Carnegie Mellon University; Shuhui Wang, Chinese Academy of Sciences; Feida Zhu, Singapore Management University; Jinbo Zhang, Peking University; Ramayya Krishnan, Carnegie Mellon University
  • In Search of Influential Event Organizers in Online Social Networks 
    Kaiyu Feng, Nanyang Technological University; Gao Cong, Nanyang Technological University; Sourav Bhowmick, Nanyang Technological University; Shuai Ma, Beihang University
  • Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency
    Youze Tang, Nanyang Technological University; Xiaokui Xiao, Nanyang Technological University; Yanchen Shi, Nanyang Technological University
  • Efficient Location-Aware Influence Maximization
    Guoliang Li, Tsinghua University; Shuo Chen, Tsinghua University; Jianhua Feng, Tsinghua University; Kian-Lee Tan, National University of Singapore; Wan-Syan Li, SAP
  • Tracking Set Correlations at Large Scale
    Foteini Alvanaki, Saarland University; Sebastian Michel, Saarland University
  • Aggregate Estimation Over a Microblog Platform
    Saravanan Thirumuruganathan, University of Texas at Arlington; Nan Zhang, George Washington University; Vagelis Hristidis, UC Riverside; Gautam Das, University of Texas at Arlington
  • Tripartite Graph Clustering for Dynamic Sentiment Analysis on Social Media
    Linhong Zhu, University of Southern California; Aram Galstyan, University of Southern California; James Cheng, Chinese University of Hong Kong; Kristina Lerman, University of Southern California
  • A Temporal Context-Aware Model for User Behavior Modeling in Social Media Systems
    Hongzhi Yin, Peking University; Bin Cui, Peking University; Ling Chen, University of Technology, Sydney; Zhiting Hu, Peking University; Zi Huang, University of Queensland
  • Querying K-Truss Community in Large and Dynamic Graphs
    Xin Huang, Chinese University of Hong Kong; Hong Cheng, Chinese University of Hong Kong; Lu Qin, University of Technology, Sydney; Wentao Tian, Chinese University of Hong Kong; Jeffrey Xu Yu, Chinese University of Hong Kong
  • Reachability Queries on Large Dynamic Graphs: A Total Order Approach
    Andy Diwen Zhu, NTU Singapore; Wenqing Lin, NTU Singapore; Sibo Wang, NTU Singapore; Xiaokui Xiao, Nanyang Technological University
  • EAGr: Supporting Continuous Ego-centric Aggregation Queries on Large Dynamic Graphs
    Jayanta Mondal, University of Maryland; Amol Deshpande, University of Mayland
  • Localizing Anomalous Changes in Time-evolving Graphs
    Sricharan Kumar, Palo Alto Research Center; Kamalika Das, UARC NASA Ames Research Center
  • CrowdFill: Collecting Structured Data from the Crowd
    Hyunjung Park, Stanford University; Jennifer Widom, Stanford University
  • OASSIS: Query Driven Crowd Mining
    Yael Amsterdamer, Tel Aviv University; Susan Davidson, University of Pennsylvania; Tova Milo, Tel Aviv University; Slava Novgorodov, Tel Aviv University; Amit Somech, Tel Aviv University
  • Corleone: Hands-Off Crowdsourcing for Entity Matching
    Chaitanya Gokhale, University of Wisconsin Madison; Sanjib Das, University of Wisconsin Madison; AnHai Doan, University of Wisconsin Madison; Jeffrey Naughton, University of Wisconsin Madison; Narasimhan Rampalli, @WalmartLabs; Jude Shavlik, University of Wisconsin Madison; Jerry Zhu, University of Wisconsin Madison
  • Descriptive and Prescriptive Data Cleaning
    Anup Chalamalla, University of Waterloo; Ihab Ilyas, University of Waterloo; Mourad Ouzzani, Qatar Computing Research Institute; Paolo Papotti, Qatar Computing Research Institute
  • Towards Dependable Data Repairing with Fixing Rules
    Jiannan Wang, UC Berkeley; Nan Tang, Qatar Computing Research Institute
  • A Sample-and-Clean Framework for Fast and Accurate Query Processing on Dirty Data
    Jiannan Wang, UC Berkeley; Sanjay Krishnan, UC Berkeley; Michael Franklin, UC Berkeley; Ken Goldberg, UC Berkeley; Tim Kraska, Brown University; Tova Milo, Tel Aviv University
  • Fusing Data with Correlations
    Ravali Pochampally, University of Massachusetts Amherst; Anish Das Sarma, Troo.Ly Inc; Xin Dong, Google Inc; Alexandra Meliou, University of Massachusetts Amherst; Divesh Srivastava, AT&T Labs Research
  • Density-based Place Clustering in Geo-Social Networks
    Jieming Shi, University of Hong Kong; Nikos Mamoulis, University of Hong Kong; Dingming Wu, University of Hong Kong; David Cheung, University of Hong Kong
  • Hypersphere Dominance: An Optimal Approach
    Cheng Long, Hong Kong University of Science and Technology; Raymond Chi-Wing Wong, Hong Kong University of Science and Technology; Bin Zhang, Hong Kong University of Science and Technology; Min Xie, Hong Kong University of Science and Technology
  • Efficient Algorithms for Optimal Location Queries in Road Networks
    Zitong Chen, ; Yubao Liu, Sun Yat-Sen University; Raymond Chi-Wing Wong, Hong Kong University of Science and Technology; Jiamin Xiong, ; Ganglin Mai, ; Cheng Long, Hong Kong University of Science and Technology
  • Robust Set Reconciliation
    Di Chen, Hong Kong University of Science and Technology; Christian Konrad, Reykjavik University; Ke Yi, Hong Kong University of Science and Technology; Wei Yu, Aarhus University; Qin Zhang, Indiana University Bloomington
  • The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs
    Panos Parchas, Hong Kong University of Science and Technology; Francesco Gullo, Yahoo Labs; Dimitris Papadias, Hong Kong University of Science and Technology; Francesco Bonchi, Yahoo Labs
  • Navigating the Maze of Graph Analytics Frameworks using Massive Graph Datasets
    Nadathur Satish, Intel Labs; Narayanan Sundaram, Intel Labs; Mostofa Patwary, Intel Labs; Jiwon Seo, Stanford University; Jongsoo Park, Intel Labs; Muhammad Hassaan, Intel Labs; Shubho Sengupta, Intel Labs; Zhaoming Yin, Georgia Tech; Pradeep Dubey, Intel Labs
  • Local Search of Communities in Large Graphs
    Wanyun Cui, Fudan University; Yanghua Xiao, Fudan University; Haixun Wang, Google Research; Wei Wang, Fudan University
  • Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs
    Akhil Arora, Indian Institute of Technology, Kanpur; Mayank Sachan, Indian Institute of Technology, Kanpur; Arnab Bhattacharya, Indian Institute of Technology, Kanpur
  • TriAD: A Distributed Shared-Nothing RDF Engine based on Asynchronous Message Passing
    Sairam Gurajada, MPI Informatics; Stephan Seufert, MPI Informatics; Iris Miliaraki, MPI Informatics; Martin Theobald, University of Antwerp
  • Querying Big Graphs within Bounded Resources
    Wenfei Fan, University of Edinburgh; Xin Wang, Southwest Jiaotong University; Yinghui Wu, UC Santa Barbara
  • Natural Language Question Answering over RDF
    Lei Zou, Peking University; Ruizhe Huang, Peking University; Haixun Wang, Microsoft Research Asia; Jeffrey Xu Yu, Chinese University of Hong Kong; Wenqiang He, Peking University; Dongyan Zhao, Peking University
  • Scalable Similarity Search for SimRank
    Mitsuru Kusumoto, Preferred Infrastructure Inc; Takanori Maehara, National Institute of Informatics Tokyo; Ken-ichi Kawarabayashi, National Institute of Informatics Tokyo
  • Efficient Cohesive Subgraphs Detection in Parallel
    Yingxia Shao, Peking University; Lei Chen, Hong Kong University of Science and Technology; Bin Cui, Peking University
  • Parallel Subgraph Listing in a Large-Scale Graph
    Yingxia Shao, Peking University; Bin Cui, Peking University; Lei Chen, Hong Kong University of Science and Technology; Lin Ma, Peking University; Junjie Yao, Peking University; Ning Xu, Peking University
  • OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs
    Jinha Kim, Pohang University of Science and Technology (POSTECH); Wook-Shin Han Pohang University of Science and Technology (POSTECH); Sangyeon Lee, Pohang University of Science and Technology (POSTECH); Kyungyeol Park, Pohang University of Science and Technology (POSTECH); Hwanjo Yu, Pohang University of Science and Technology (POSTECH)
  • Indexing for Interactive Exploration of Big Data Series
    Kostas Zoumpatianos, University of Trento; Stratos Idreos, Harvard University; Themis Palpanas, University of Trento
  • Histograms as a Side Effect of Data Movement for Big Data
    Zsolt Istvan, ETH Zurich; Louis Woods, ETH Zurich; Gustavo Alonso, ETH Zurich
  • A Formal Approach to Finding Explanations for Database Queries
    Sudeepa Roy, University of Washington; Dan Suciu, University of Washington
  • MISO: Souping Up Big Data Query Processing with a Multistore System
    Jeff LeFevre, UC Santa Cruz; Jagan Sankaranarayanan, NEC Labs America; Hakan Hacigumus, NEC Labs America; Junichi Tatemura, NEC Labs America; Neoklis Polyzotis, UC Santa Cruz; Michael Carey, UC Irvine
  • Which Concepts Are Worth Extracting?
    Arash Termehchy, Oregon State University; Ali Vakilian, MIT; Yodsawalai Chodpathumwan, University of Illinois at Urbana-Champaign; Marianne Winslett, University of Illinois at Urbana-Champaign
  • Querying Virtual Hierarchies using Virtual Prefix-Based Numbers
    Curtis Dyreson, Utah State University; Sourav Bhowmick, Nanyang Technological University; Ryan Grapp, Utah State University
  • NLyze: Interactive Programming by Natural Language for SpreadSheet Data Analysis and Manipulation
    Sumit Gulwani, Microsoft Research; Mark Marron, Microsoft Research
  • Sinew: a SQL System for Unified Analytics of Multi-structured Data
    Daniel Tahara, Yale University; Thaddeus Diamond, Hadapt; Daniel Abadi, Yale University
  • Overlap Interval Partition Join
    Anton Dignos, University of Zurich; Michael Bohlen, University of Zurich; Johann Gamper, Free University of Bozen-Bolzano
  • Similarity Joins for Uncertain Strings
    Manish Patil, Louisiana State University; Rahul Shah, Louisiana State University
  • Track Join: Distributed Joins with Minimal Network Traffic
    Orestis Polychroniou, Columbia University; Rajkumar Sen, Oracle Corporation; Kenneth Ross, Columbia University
  • On-the-Fly Token Similarity Joins in Relational Databases
    Nikolaus Augsten, University of Salzburg; Armando Miraglia, VU University Amsterdam; Thomas Neumann, TU Munchen; Alfons Kemper, TU Munchen
  • Knowing When You're Wrong: Building Fast and Reliable Approximate Query Processing Systems
    Sameer Agarwal, UC Berkeley; Henry Milner, UC Berkeley; Ariel Kleiner, UC Berkeley; Ameet Talwalkar, UC Berkeley; Michael Jordan, UC Berkeley; Sam Madden, MIT; Barzan Mozafari, University of Michigan; Ion Stoica, UC Berkeley
  • Discovering Queries based on Example Tuples
    Yanyan Shen, National University of Singapore; Kaushik Chakrabarti, Microsoft Research; Surajit Chaudhuri, Microsoft Research; Bolin Ding, Microsoft Research; Lev Novik, Microsoft
  • Interactive Data Exploration Using Semantic Windows
    Alexander Kalinin, Brown University; Ugur Cetintemel, Brown University; Stan Zdonik, Brown University
  • Explore-by-Example: An Automatic Query Steering Framework for Interactive Data Exploration
    Kyriaki Dimitriadou, Brandeis University; Olga Papaemmanouil, Brandeis University; Yanlei Diao, University of Massachusetts Amherst
  • Modeling Entity Evolution for Temporal Record Matching
    Yueh-Hsuan Chiang, University of Wisconsin Madison; AnHai Doan, University of Wisconsin Madison; Jeffrey Naughton, University of Wisconsin Madison
  • Resolving Conflicts in Heterogeneous Data by Truth Discovery and Source Reliability Estimation
    Qi Li, SUNY Buffalo; Yaliang Li, SUNY Buffalo; Jing Gao, SUNY Buffalo; Bo Zhao, Microsoft Research; Wei Fan, Huawei Noah’s Ark Lab; Jiawei Han, University of Illinois
  • A Probabilistic Model for Linking Named Entities in Web Text with Heterogeneous Information Networks
    Wei Shen, Tsinghua University; Jiawei Han, UIUC; Jianyong Wang, Tsinghua University
  • Matching Heterogeneous Event Data
    Xiaochen Zhu, Tsinghua University; Shaoxu Song, Tsinghua University; Xiang Lian, University of Texas - Pan American; Jianmin Wang, Tsinghua University; Lei Zou, Peking University
  • Complete Yet Practical Search for Minimal Query Reformulations Under Constraints
    Ioana Ileana, Telecom Paris Tech; Bogdan Cautis, University of Paris-Sud; Alin Deutsch, UC San Diego; Yannis Katsis, UC San Diego
  • Query Shredding: Efficient Relational Evaluation of Nested Queries
    Sam Lindley, University of Edinburgh; James Cheney, University of Edinburgh; Philip Wadler, University of Edinburgh
  • Plan Bouquets: Query Processing without Selectivity Estimation
    Anshuman Dutt, Indian Institute of Science; Jayant Haritsa, Indian Institute of Science
  • Schema-free SQL
    Fei Li, University of Michigan; Tianyin Pan, University of Michigan; H. V. Jagadish, University of Michigan
  • Towards Unified Ad-hoc Data Processing
    Xiaogang Shi, Peking University; Bin Cui, Peking University; Gillian Dobbie, University of Auckland; Beng Chin Ooi, National University of Singapore
  • Partial Results in Database Systems
    Willis Lang, ; Rimma Nehme, GreySystems Lab; Eric Robinson, Microsoft; Jeffrey Naughton, University of Wisconsin Madison
  • Parallel In-Situ Data Processing with Speculative Loading
    Yu Cheng, UC Merced; Florin Rusu, UC Merced
  • Approximation Schemes for Many-Objective Query Optimization
    Immanuel Trummer, EPFL; Christoph Koch, EPFL
  • H2O: A Hands-Free Adaptive Store
    Ioannis Alagiannis, EPFL; Stratos Idreos, Harvard University; Anastasia Ailamaki, EPFL
  • Fine-grained Blocking for Aggressive Data Skipping
    Liwen Sun, UC Berkeley; Michael Franklin, UC Berkeley; Sanjay Krishnan, UC Berkeley; Reynold Xin, UC Berkeley
  • DSH: Data Sensitive Hashing for High-Dimensional k-NN Search
    Jinyang Gao, National University of Singapore; H. V. Jagadish, University of Michigan; Wei Lu, National University of Singapore; Beng Chin Ooi, National University of Singapore
  • Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs
    Yubao Wu, Case Western Reserve University; Ruoming Jin, Kent State University; Xiang Zhang, Case Western Reserve University
  • Global Immutable Region Computation
    Jilian Zhang, Singapore Management University; Kyriakos Mouratidis, Singapore Management University; HweeHwa Pang, Singapore Management University
  • Answering Top-k Representative Queries on Graph Databases
    Sayan Ranu, IIT Madras; Minh Hoang, UCSB; Ambuj Singh, UCSB
  • Knowledge Expansion over Probabilistic Knowledge Bases
    Yang Chen, University of Florida; Daisy Zhe Wang, University of Florida
  • InsightNotes: Summary-Based Annotation Management in Relational Databases
    Dongqing Xiao, Worcester Polytechnic Institute; Mohamed Eltabakh, Worcester Polytechnic Institute
  • A Pivotal Prefix Based Filtering Algorithm for String Similarity Search
    Dong Deng, Tsinghua University; Guoliang Li, Tsinghua University; Jianhua Feng, Tsinghua University

  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值